More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding
From MaRDI portal
Publication:3604768
DOI10.1109/TIT.2008.926326zbMath1329.94046OpenAlexW2098751383MaRDI QIDQ3604768
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2008.926326
Related Items
Efficient and compact representations of some non-canonical prefix-free codes, On the construction of prefix-free and fix-free codes with specified codeword compositions