A combinatorial approach to Golomb forests
Theoretical Computer Science
Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
PCM '01 Proceedings of the Second IEEE Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
Algorithms for infinite huffman-codes
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The construction of codes for infinite sets
SAICSIT '04 Proceedings of the 2004 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries
New bounds on D-ary optimal codes
Information Processing Letters
Online prefix-free encoding algorithm
SPPRA'06 Proceedings of the 24th IASTED international conference on Signal processing, pattern recognition, and applications
New bounds on D-ary optimal codes
Information Processing Letters
| Hi-index | 754.84 |
It is proven that for every random variable with a countably infinite set of outcomes and finite entropy there exists an optimal prefix code which can be constructed from Huffman codes for truncated versions of the random variable, and that the average lengths of any sequence of Huffman codes for the truncated versions converge to that of the optimal code. Also, it is shown that every optimal infinite code achieves Kraft's inequality with equality