A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs

DOI10.1007/3-540-60084-1_79zbMath1412.68083OpenAlexW2075346951MaRDI QIDQ4645183

Günter Rote, Mordecai J. Golin

Publication date: 10 January 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60084-1_79

zbMATH Keywords

dynamic programming algorithmminimum costlevel truncationinternal nodedeep node

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Dynamic programming (90C39)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Codes: Unequal Probabilities, Unequal Letter Cost
• Efficient Generation of Optimal Prefix Code
• Optimum lopsided binary trees
• Tree Structures for Optimal Searching
• Prefix Codes: Equiprobable Words, Unequal Letter Costs

This page was built for publication: A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs