Optimum extensions of prefix codes.

DOI10.1016/S0020-0190(98)00026-XMaRDI QIDQ2583535zbMATH OpenOpenAlexFDO

Authors Ion Măndoiu

Publication date 17 January 2006

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(98)00026-x

zbMATH Keywords

AlgorithmsDynamic programmingPrefix codesQuadrangle inequality

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 1543071
• scientific article; zbMATH DE number 4063000
• Optimum '1'-ended binary prefix codes
• A fast and space-economical algorithm for length-limited coding
• A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 1543071 (Why is no real title available?)
• A Method for the Construction of Minimum-Redundancy Codes
• Generating a canonical prefix encoding
• Geometric applications of a matrix-searching algorithm
• Height Restricted Optimal Binary Trees
• Optimal Alphabetic Trees
• Optimal Binary Search Trees with Restricted Maximal Depth
• Optimal alphabetic search trees with restricted maximal height
• Optimum binary search trees
• The construction of optimal multiway search trees and the monotonicity principle

Cited in

(5)

• scientific article; zbMATH DE number 1543071 (Why is no real title available?)
• Optimal prefix free codes with partial sorting
• Minimum Delay Codes
• A note on the construction of error detecting/correcting prefix codes
• A fast and space-economical algorithm for length-limited coding

This page was built for publication: Optimum extensions of prefix codes.

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