Optimum extensions of prefix codes.

DOI10.1016/S0020-0190(98)00026-XzbMath1078.94509OpenAlexW2130155094MaRDI QIDQ2583535

Ion I. 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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Geometric applications of a matrix-searching algorithm
• Optimal alphabetic search trees with restricted maximal height
• Optimum binary search trees
• Height Restricted Optimal Binary Trees
• The construction of optimal multiway search trees and the monotonicity principle
• Optimal Alphabetic Trees
• Optimal Binary Search Trees with Restricted Maximal Depth
• Generating a canonical prefix encoding
• A Method for the Construction of Minimum-Redundancy Codes

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