2000 character limit reached
A Characterization of Optimal Prefix Codes
Published 13 Nov 2023 in cs.IT and math.IT | (2311.07007v3)
Abstract: A property of prefix codes called strong monotonicity is introduced, and it is proven that for a given source, a prefix code is optimal if and only if it is complete and strongly monotone.
- L. Cao, L. Yao, and C. W. Chen, “MAP decoding of variable length codes with self-synchronization strings”, IEEE Transactions on Signal Processing, vol. 55, no. 8, pp. 4325 – 4330, September 2007.
- S. Congero and K. Zeger, “Competitive advantage of Huffman and Shannon-Fano codes”, IEEE Transactions on Information Theory (revised April 9, 2024), Also available on: arXiv:2311.07009 [cs.IT].
- A. E. Escott and S. Perkins, “Binary Huffman equivalent codes with a short synchronizing codeword”, IEEE Transactions on Information Theory, vol. 44, no. 1, pp. 346 – 351, January 1998.
- T. Ferguson and J. Rabinowitz, “Self-synchronizing Huffman codes”, IEEE Transactions on Information Theory, vol. 30, no. 4, pp. 687 –6 93, July 1984.
- C. Freiling, D. Jungreis, F. Théberge, and K. Zeger, “Almost all complete binary prefix codes have a self-synchronizing string”, IEEE Transactions on Information Theory, vol. 49, no. 9, pp. 2219 – 2225, September 2003.
- R. G. Gallager, “Variations on a theme by Huffman”, IEEE Transactions on Information Theory, vol. 24, no. 6, pp. 668 – 8674, November 1978.
- M. B. J. Higgs, S. Perkins, and D. H. Smith, “The construction of variable length codes with good synchronization properties”, IEEE Transactions on Information Theory, vol. 55, no. 4, pp. 1696 – 1700, April 2009.
- D. A. Huffman, “A method for the construction of minimum-redundancy codes”, Proceedings of the IRE, vol. 40, no. 9, pp. 1098 – 1101, September 1952.
- L. G. Kraft, “A device for quantizing, grouping, and coding amplitude modulated pulses”, MS Thesis, Cambridge, MA: Massachusetts Institute of Technology Electrical Engineering Department, 1949.
- G. Longo and G. Galasso, “An application of informational divergence to Huffman codes”, IEEE Transactions on Information Theory, vol. 28, no. 1, pp. 36 – 43, January 1982,
- S. K. Manickam, “Probability mass functions for which sources have the maximum minimum expected length”, National Conference on Communications (NCC), Bangalore, India, pp. 1 – 6, February 20-23, 2019.
- G. Zhou and Z. Zhang, “Synchronization recovery of variable-length codes”, IEEE Transactions on Information Theory, vol. 48, no. 1, pp. 219 – 227, February 2002.
- J. Zhou and O. C. Au, “Error recovery of variable length code over BSC with arbitrary crossover probability”, IEEE Transactions on Communications, vol. 58, no. 6, pp. 1654 – 1666, June 2010.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.