The Universality of Grammar-Based Codes for Sources With Countably Infinite Alphabets

DOI10.1109/TIT.2005.856948MaRDI QIDQ3547014zbMATH OpenOpenAlexFDO

Authors Dake He, Enhui Yang

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.2005.856948

Mathematics Subject Classification ID

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

Recommendations

• Universal coding for memoryless sources with countably infinite alphabets
• Universal Weak Variable-Length Source Coding on Countably Infinite Alphabets
• Coding on Countably Infinite Alphabets
• Grammar-based codes: a new class of universal lossless source codes
• Universal Coding on Infinite Alphabets: Exponentially Decreasing Envelopes
• Existence of optimal prefix codes for infinite source alphabets
• Context-free languages over infinite alphabets
• scientific article; zbMATH DE number 1834677
• Codes which are minimal generators of languages of biinfinite words
• Algorithmic ways of deciding whether an infinite language is a code

Cited in

(5)

• Universal coding for memoryless sources with countably infinite alphabets
• Structured grammar-based codes for universal lossless data compression.
• Grammar-Based Lossless Universal Refinement Source Coding
• Performance Analysis of Grammar-Based Codes Revisited
• Grammar-based codes: a new class of universal lossless source codes

This page was built for publication: The Universality of Grammar-Based Codes for Sources With Countably Infinite Alphabets

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