A fast and space-economical algorithm for length-limited coding

DOI10.1007/BFB0015404MaRDI QIDQ6487940zbMATH OpenFDO

Authors Jyrki Katajainen, Alistair Moffat, Andrew Turpin

Publication date 21 March 2023

Full work available at URL https://doi.org/10.1007/BFB0015404

Mathematics Subject Classification ID

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

Recommendations

• Efficient construction of minimum-redundancy codes for large alphabets
• Three space-economical algorithms for calculating minimum-redundancy prefix codes
• A fast algorithm for optimal length-limited Huffman codes
• Optimum extensions of prefix codes.
• In-place calculation of minimum-redundancy codes

Cites work

• A fast algorithm for optimal length-limited Huffman codes
• A Method for the Construction of Minimum-Redundancy Codes
• Constructing codes with bounded codeword lengths (Corresp.)
• Constructing Huffman Trees in Parallel
• scientific article; zbMATH DE number 3558968 (Why is no real title available?)
• scientific article; zbMATH DE number 910897 (Why is no real title available?)
• Path Length of Binary Search Trees

Cited in

(7)

• A fast algorithm for adaptive prefix coding
• Optimum extensions of prefix codes.
• A fast algorithm for optimal length-limited Huffman codes
• A generalized method for encoding and decoding run-length-limited binary sequences (Corresp.)
• Three space-economical algorithms for calculating minimum-redundancy prefix codes
• In-place calculation of minimum-redundancy codes
• Run-Length Encoding in a Finite Universe

This page was built for publication: A fast and space-economical algorithm for length-limited coding

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