Sources which maximize the choice of a Huffman coding tree

DOI10.1016/S0019-9958(80)90648-8zbMath0462.94011MaRDI QIDQ3912477

Solomon W. Golomb

Publication date: 1980

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

zbMATH Keywords

Fibonacci numberbinary coding trees

Mathematics Subject Classification ID

Source coding (94A29)

Related Items (5)

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

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