Coding on Countably Infinite Alphabets
From MaRDI portal
Publication:4975701
DOI10.1109/TIT.2008.2008150zbMath1367.94151arXiv0801.2456WikidataQ58374460 ScholiaQ58374460MaRDI QIDQ4975701
Elisabeth Gassiat, Stéphane Boucheron, Aurélien Garivier
Publication date: 8 August 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0801.2456
Bounds on codes (94B65) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Coding theorems (Shannon theory) (94A24)
Related Items (3)
Some properties of Rényi entropy over countably infinite alphabets ⋮ A Bernstein-von Mises theorem for discrete probability distributions ⋮ Universal coding for memoryless sources with countably infinite alphabets
This page was built for publication: Coding on Countably Infinite Alphabets
