Huffman-type codes for infinite source distributions

DOI10.1016/0016-0032(94)90099-XzbMath0821.94019OpenAlexW2061712317MaRDI QIDQ1804258

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

geometric distributioncodeword lengthHuffman-type codesinfinite source distribution

Mathematics Subject Classification ID

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

Related Items (max. 100)

A combinatorial approach to Golomb forests ⋮ Optimal Prefix Codes And Huffman Codes

Cites Work

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

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