Algorithms for infinite Huffman-codes

zbMATH Open1318.94056MaRDI QIDQ5501337FDOQ5501337

Authors: Kin Keung Ma, Mordecai J. Golin 

Publication date: 3 August 2015

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

Mathematics Subject Classification ID

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

Cited In (9)

• Near-Optimal Depth-Constrained Codes
• New bounds on \(D\)-ary optimal codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the optimal pairwise group testing algorithm
• Huffman code efficiencies for extensions of sources
• Title not available (Why is that?)
• Optimal prefix codes for sources with two-sided geometric distributions
• Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs

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)