Huffman coding with an infinite alphabet

DOI10.1109/18.490559MaRDI QIDQ4887073zbMATH OpenOpenAlexFDO

Authors Akiko Kato, Te Sun Han, Hiroshi Nagaoka

Publication date 31 July 1996

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.490559

zbMATH Keywords

coding of integersentropyHuffman codingprefix code

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Measures of information, entropy (94A17) Source coding (94A29) Prefix, length-variable, comma-free codes (94A45)

Recommendations

• Existence of optimal prefix codes for infinite source alphabets
• Huffman-type codes for infinite source distributions
• Algorithms for infinite Huffman-codes
• Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs
• scientific article; zbMATH DE number 2036351

Cited in

(9)

• New bounds on \(D\)-ary optimal codes
• Huffman-type codes for infinite source distributions
• Huffman code efficiencies for extensions of sources
• Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs
• Optimal source coding for a class of integer alphabets (Corresp.)
• scientific article; zbMATH DE number 2036351 (Why is no real title available?)
• scientific article; zbMATH DE number 826041 (Why is no real title available?)
• Algorithms for infinite Huffman-codes
• A combinatorial approach to Golomb forests

This page was built for publication: Huffman coding with an infinite alphabet

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