Huffman-type codes for infinite source distributions

DOI10.1016/0016-0032(94)90099-XMaRDI QIDQ1804258zbMATH OpenOpenAlexFDO

Authors Julia Abrahams

Publication date 11 May 1995

Published in Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0016-0032(94)90099-x

zbMATH Keywords

codeword lengthgeometric distributionHuffman-type codesinfinite source distribution

Mathematics Subject Classification ID

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

Recommendations

• Huffman coding with an infinite alphabet
• Algorithms for infinite Huffman-codes
• Existence of optimal prefix codes for infinite source alphabets
• Optimal source coding for a class of integer alphabets (Corresp.)
• Relative uniformity of sources and the comparison of optimal code costs

Cites work

• A Dichotomous Search for a Geometric Random Variable
• On Finding a Single Defective in Binomial Group Testing
• On optimal nested group testing algorithms
• Optimal source codes for geometrically distributed integer alphabets (Corresp.)
• Optimal source coding for a class of integer alphabets (Corresp.)
• Run-length encodings (Corresp.)

Cited in

(9)

• Huffman algebras for independent random variables
• Huffman code efficiencies for extensions of sources
• Optimal source coding for a class of integer alphabets (Corresp.)
• Relative uniformity of sources and the comparison of optimal code costs
• Optimal Prefix Codes And Huffman Codes
• Huffman coding with an infinite alphabet
• Algorithms for infinite Huffman-codes
• A combinatorial approach to Golomb forests
• On the optimal pairwise group testing algorithm

This page was built for publication: Huffman-type codes for infinite source distributions

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