On the construction of prefix-free and fix-free codes with specified codeword compositions
From MaRDI portal
Publication:765325
DOI10.1016/j.dam.2011.08.003zbMath1233.94012arXiv1002.0097OpenAlexW2104932738MaRDI QIDQ765325
Ali Kakhbod, Morteza Zadimoghaddam
Publication date: 19 March 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1002.0097
Cites Work
- More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding
- Codes: Unequal Probabilities, Unequal Letter Cost
- Conjectures on uniquely decipherable codes (Corresp.)
- Some basic properties of fix-free codes
- A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs
- A Method for the Construction of Minimum-Redundancy Codes