Optimal Prefix Codes And Huffman Codes

DOI10.1080/0020716031000087140zbMath1045.94009OpenAlexW2056723920MaRDI QIDQ4464415

Ming Li, Dong Yang Long, Wei-Jia Jia

Publication date: 27 May 2004

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0020716031000087140

zbMATH Keywords

Huffman codemaximal prefix codeoptimal prefix codedata transmission and compression

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Prefix, length-variable, comma-free codes (94A45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity aspects of guessing prefix codes
• Huffman-type codes for infinite source distributions
• On the redundancy of optimal binary prefix-condition codes for finite and infinite sources (Corresp.)
• CRYPTOGRAPHIC ASPECTS OF DATA COMPRESSION CODES
• Design and analysis of dynamic Huffman codes
• Optimal source codes for geometrically distributed integer alphabets (Corresp.)
• Existence of optimal prefix codes for infinite source alphabets
• On breaking a Huffman code
• A Method for the Construction of Minimum-Redundancy Codes