Generalized Huffman coding for binary trees with choosable edge lengths
From MaRDI portal
Publication:2512825
DOI10.1016/j.ipl.2014.11.013zbMath1314.05039arXiv1402.3435MaRDI QIDQ2512825
Publication date: 30 January 2015
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.3435
Cites Work
- Binary trees with choosable edge lengths
- The repeater tree construction problem
- Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme
- Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
- A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs
- Coding with digits of unequal cost
- Shallow-Light Steiner Arborescences with Vertex Delays
- A Method for the Construction of Minimum-Redundancy Codes