Lossless compression algorithm based on context tree

DOI10.7540/J.YNU.20190644MaRDI QIDQ4985808zbMATH OpenFDO

Authors Jiong Wang, Zhiyuan He, Jianhua Chen

Publication date 26 April 2021

Full work available at URL https://doi.org/10.7540/J.YNU.20190644

zbMATH Keywords

context modelingdescription lengthentropy codingescape symbollossless compression

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Source coding (94A29)

Recommendations

• An Algorithm for Universal Lossless Compression With Side Information
• Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform-part two: with context models
• The context-tree weighting method: extensions
• Universal Lossless Compression of Erased Symbols
• Lossless compression of map contours by context tree modeling of chain codes

Cited in

(3)

• Lossless Compression of Binary Trees With Correlated Vertex Names
• Polynomial representation of binary trees of entropy binary codes
• Lossless compression of map contours by context tree modeling of chain codes

This page was built for publication: Lossless compression algorithm based on context tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4985808)