Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs
From MaRDI portal
Publication:3604634
DOI10.1109/TIT.2007.915696zbMath1311.94060arXivcs/0511003MaRDI QIDQ3604634
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0511003
Related Items (3)
Tsallis entropy measure of noise-aided information transmission in a binary channel ⋮ Source coding with escort distributions and Rényi entropy bounds ⋮ Alphabetic coding with exponential costs
This page was built for publication: Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs
