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

DOI10.1109/18.841161MaRDI QIDQ4503584zbMATH OpenOpenAlexFDO

Authors Enhui Yang, John C. 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

arithmetic codingentropy rategreedy grammar transformhierarchical data compressionredundancystring matchinguniversal 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)

Recommendations

• Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform-part two: with context models
• Universal lossless data compression with side information by using a conditional MPM grammar transform
• Structured grammar-based codes for universal lossless data compression.
• Grammar-based codes: a new class of universal lossless source codes
• scientific article; zbMATH DE number 2119662

Cited in

(14)

• Structured grammar-based codes for universal lossless data compression.
• Collage system: A unifying framework for compressed pattern matching.
• 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
• Sensitivity of string compressors and repetitiveness measures
• Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform-part two: with context models
• Extension and faster implementation of the GRP transform for lossless compression
• Grammar-based codes: a new class of universal lossless source codes
• Universal lossless data compression with side information by using a conditional MPM grammar transform
• Random access to grammar-compressed strings and trees
• Tight bounds for compressing substring samples

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

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