Grammar-Based Lossless Universal Refinement Source Coding

DOI10.1109/TIT.2004.830758MaRDI QIDQ3547138zbMATH OpenOpenAlexFDO

Authors Enhui Yang, John C. Kieffer

Publication date 21 December 2008

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

Full work available at URL https://doi.org/10.1109/tit.2004.830758

Mathematics Subject Classification ID

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

Recommendations

• Grammar-based codes: a new class of universal lossless source codes
• Structured grammar-based codes for universal lossless data compression.
• Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform-part two: with context models
• The Universality of Grammar-Based Codes for Sources With Countably Infinite Alphabets
• Universal lossless data compression with side information by using a conditional MPM grammar transform

Cited in

(2)

• Structured grammar-based codes for universal lossless data compression.
• Grammar-based codes: a new class of universal lossless source codes

This page was built for publication: Grammar-Based Lossless Universal Refinement Source Coding

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