Huffman coding with an infinite alphabet

DOI10.1109/18.490559zbMath0857.94008OpenAlexW2016524125MaRDI QIDQ4887073

T. S. Han, Akiko Kato, Hiroshi Nagaoka

Publication date: 31 July 1996

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.490559

zbMATH Keywords

entropyprefix codeHuffman codingcoding of integers

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Measures of information, entropy (94A17) Prefix, length-variable, comma-free codes (94A45) Source coding (94A29)

Related Items (2)

A combinatorial approach to Golomb forests ⋮ New bounds on \(D\)-ary optimal codes

This page was built for publication: Huffman coding with an infinite alphabet