Efficient construction of minimum-redundancy codes for large alphabets

DOI10.1109/18.681345MaRDI QIDQ4701144zbMATH OpenOpenAlexFDO

Authors 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

Huffman codelength-limitedminimum-redundancy codesprefix code

Mathematics Subject Classification ID

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

Recommendations

• Three space-economical algorithms for calculating minimum-redundancy prefix codes
• Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes
• In-place calculation of minimum-redundancy codes
• Optimal prefix codes with fewer distinct codeword lengths are faster to construct

Cited in

(10)

• Minimal expansions in redundant number systems and shortest paths in graphs
• Optimal prefix codes with fewer distinct codeword lengths are faster to construct
• Fast codes for large alphabets
• Speeding up the AIFV-2 dynamic programs by two orders of magnitude using range minimum queries
• scientific article; zbMATH DE number 4210044 (Why is no real title available?)
• scientific article; zbMATH DE number 2065860 (Why is no real title available?)
• Three space-economical algorithms for calculating minimum-redundancy prefix codes
• In-place calculation of minimum-redundancy codes
• Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes
• A fast and space-economical algorithm for length-limited coding

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701144)