Algorithms for infinite Huffman-codes

MaRDI QIDQ5501337zbMATH OpenFDO

Authors Kin Keung Ma, Mordecai J. Golin

Publication date 3 August 2015

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45)

Recommendations

• Existence of optimal prefix codes for infinite source alphabets
• A combinatorial approach to Golomb forests
• Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs
• Huffman coding with an infinite alphabet
• Huffman-type codes for infinite source distributions

Cited in

(10)

• Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs
• Near-Optimal Depth-Constrained Codes
• scientific article; zbMATH DE number 2036351 (Why is no real title available?)
• Optimal prefix codes for sources with two-sided geometric distributions
• Huffman code efficiencies for extensions of sources
• scientific article; zbMATH DE number 3949708 (Why is no real title available?)
• On the optimal pairwise group testing algorithm
• New bounds on \(D\)-ary optimal codes
• First come first served for online slot allocation and Huffman coding
• scientific article; zbMATH DE number 1848287 (Why is no real title available?)

This page was built for publication: Algorithms for infinite Huffman-codes

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