Prefix codes: Equiprobable words, unequal letter costs

DOI10.1007/3-540-58201-0_102zbMath1418.68119OpenAlexW2164823137MaRDI QIDQ4632460

Neal E. Young, Mordecai J. Golin

Publication date: 29 April 2019

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

Full work available at URL: https://doi.org/10.1007/3-540-58201-0_102

zbMATH Keywords

algorithmstreesprefix codesHuffman codes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)

Cites Work

• Codes: Unequal Probabilities, Unequal Letter Cost
• Efficient Generation of Optimal Prefix Code
• A Method for the Construction of Minimum-Redundancy Codes
• Unnamed Item
• Unnamed Item

This page was built for publication: Prefix codes: Equiprobable words, unequal letter costs