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 (Search for Journal in Brave)

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

zbMATH Keywords

Could not fetch data.

Mathematics Subject Classification ID

Could not fetch data.

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

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)