Efficient construction of minimum-redundancy codes for large alphabets

DOI10.1109/18.681345zbMath0935.94018OpenAlexW2129999149MaRDI QIDQ4701144

Alistair Moffat, Andrew Turpin

Publication date: 21 November 1999

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

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

zbMATH Keywords

prefix codeHuffman codeminimum-redundancy codeslength-limited

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Prefix, length-variable, comma-free codes (94A45) Source coding (94A29)

Related Items (1)

Optimal prefix codes with fewer distinct codeword lengths are faster to construct

This page was built for publication: Efficient construction of minimum-redundancy codes for large alphabets