Optimal Prefix Codes And Huffman Codes

DOI10.1080/0020716031000087140MaRDI QIDQ4464415zbMATH OpenOpenAlexFDO

Authors Ming Li, Dong-Yang Long, Weijia 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

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

Recommendations

• Existence of optimal prefix codes for infinite source alphabets
• scientific article; zbMATH DE number 2036351
• scientific article; zbMATH DE number 4049549
• scientific article; zbMATH DE number 1543071
• scientific article; zbMATH DE number 4063000

Cites work

• scientific article; zbMATH DE number 3943051 (Why is no real title available?)
• scientific article; zbMATH DE number 50943 (Why is no real title available?)
• scientific article; zbMATH DE number 2104341 (Why is no real title available?)
• scientific article; zbMATH DE number 973791 (Why is no real title available?)
• A Method for the Construction of Minimum-Redundancy Codes
• CRYPTOGRAPHIC ASPECTS OF DATA COMPRESSION CODES
• Complexity aspects of guessing prefix codes
• Design and analysis of dynamic Huffman codes
• Existence of optimal prefix codes for infinite source alphabets
• Huffman-type codes for infinite source distributions
• On breaking a Huffman code
• On the redundancy of optimal binary prefix-condition codes for finite and infinite sources (Corresp.)
• Optimal source codes for geometrically distributed integer alphabets (Corresp.)

Cited in

(7)

• Worst-Case Optimal Adaptive Prefix Coding
• scientific article; zbMATH DE number 1983209 (Why is no real title available?)
• Fixed-prefix encoding of the integers can be Huffman-optimal
• scientific article; zbMATH DE number 2036351 (Why is no real title available?)
• Optimal Prefix Codes for Pairs of Geometrically Distributed Random Variables
• Fast and Compact Prefix Codes
• Binary Huffman equivalent codes with a short synchronizing codeword

This page was built for publication: Optimal Prefix Codes And Huffman Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4464415)