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

DOI10.1109/TIT.2005.856948zbMath1316.94044OpenAlexW2178984881MaRDI QIDQ3547014

Enhui Yang, Dake He

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) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Grammars and rewriting systems (68Q42) Source coding (94A29)

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