Structured grammar-based codes for universal lossless data compression.

DOI10.4310/CIS.2002.v2.n1.a2zbMath1038.94006WikidataQ114572886 ScholiaQ114572886MaRDI QIDQ1421045

Enhui Yang, John Cronan Kieffer

Publication date: 22 March 2004

Published in: Communications in Information and Systems (Search for Journal in Brave)

zbMATH Keywords

context-free grammars; redundancy; lossless data compression; universal codes; grammar-based codes

Mathematics Subject Classification ID

68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)

68Q42: Grammars and rewriting systems

94A24: Coding theorems (Shannon theory)

94A29: Source coding

Related Items

A FULLY COMPRESSED PATTERN MATCHING ALGORITHM FOR SIMPLE COLLAGE SYSTEMS

Uses Software

• OEIS