Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform. I. Without context models

DOI10.1109/18.841161zbMath1002.94013OpenAlexW4245857357MaRDI QIDQ4503584

Enhui Yang, John Cronan Kieffer

Publication date: 7 September 2000

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7de983b8ecf446baaab6b9aba87fb749b96551f0

zbMATH Keywords

redundancystring matchingarithmetic codingentropy rategreedy grammar transformhierarchical data compressionuniversal lossless data compression algorithmsuniversal sequential data compression

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Measures of information, entropy (94A17) Source coding (94A29)

Related Items (8)

Collage system: A unifying framework for compressed pattern matching. ⋮ Sensitivity of string compressors and repetitiveness measures ⋮ Time-universal data compression ⋮ On the complexity of the smallest grammar problem over fixed alphabets ⋮ Asymptotically most powerful tests for random number generators ⋮ Finger search in grammar-compressed strings ⋮ A fully linear-time approximation algorithm for grammar-based compression ⋮ Random Access to Grammar-Compressed Strings and Trees

This page was built for publication: Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform. I. Without context models