Three space-economical algorithms for calculating minimum-redundancy prefix codes

DOI10.1109/18.945242zbMath1016.94019OpenAlexW2083324355MaRDI QIDQ4544663

Artur Alves Pessoa, Eduardo Sany Laber, Ruy Luiz Milidiú

Publication date: 4 August 2002

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

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

zbMATH Keywords

algorithmsdata compressionprefix codesHuffman codesminimum redundancylarge alphabetslazy approach

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Prefix, length-variable, comma-free codes (94A45)

Related Items (1)

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

This page was built for publication: Three space-economical algorithms for calculating minimum-redundancy prefix codes