The Number of Huffman Codes, Compact Trees, and Sums of Unit Fractions
From MaRDI portal
Publication:2989426
DOI10.1109/TIT.2012.2226560zbMath1364.94673arXiv1108.5964MaRDI QIDQ2989426
Prodinger, Helmut, Christian Elsholtz, Clemens Heuberger
Publication date: 8 June 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.5964
Related Items (3)
Compositions into powers of \(b\): asymptotic enumeration and parameters ⋮ Canonical Trees, Compact Prefix-Free Codes, and Sums of Unit Fractions: A Probabilistic Analysis ⋮ DIVIDED POWER ALGEBRAS OVER AN OPERAD
This page was built for publication: The Number of Huffman Codes, Compact Trees, and Sums of Unit Fractions
