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 grammarsredundancylossless data compressionuniversal codesgrammar-based codes

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Grammars and rewriting systems (68Q42) Coding theorems (Shannon theory) (94A24) Source coding (94A29)

Related Items (1)

A FULLY COMPRESSED PATTERN MATCHING ALGORITHM FOR SIMPLE COLLAGE SYSTEMS

Uses Software

• OEIS

This page was built for publication: Structured grammar-based codes for universal lossless data compression.