Sources which maximize the choice of a Huffman coding tree

DOI10.1016/S0019-9958(80)90648-8MaRDI QIDQ3912477zbMATH OpenFDO

Authors S. W. Golomb

Publication date 1980

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(80)90648-8

zbMATH Keywords

binary coding treesFibonacci number

Mathematics Subject Classification ID

Source coding (94A29)

Cited in

(5)

• Optimal skeleton and reduced Huffman trees
• Searching and encoding for infinite ordered sets
• Optimal Skeleton Huffman Trees Revisited
• Optimal binary search trees
• Distributions of periods and frequencies of runs in random binary sequences

This page was built for publication: Sources which maximize the choice of a Huffman coding tree

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