Existence of optimal prefix codes for infinite source alphabets

DOI10.1109/18.641571zbMath0905.94024OpenAlexW2158894482MaRDI QIDQ4392408

Vahid Tarokh, Kenneth Zeger, Tamás Linder

Publication date: 8 June 1998

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

Full work available at URL: https://semanticscholar.org/paper/6b63503d0be4d54a8e537d30aae52259415cfed6

zbMATH Keywords

prefix codesHuffman codesKraft's inequalityinfinite code

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Source coding (94A29)

Related Items (5)

Optimal synchronous coding ⋮ Practical algorithms for generating a random ordering of the elements of a weighted set ⋮ A combinatorial approach to Golomb forests ⋮ Optimal Prefix Codes And Huffman Codes ⋮ New bounds on \(D\)-ary optimal codes

This page was built for publication: Existence of optimal prefix codes for infinite source alphabets