More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding
From MaRDI portal
Publication:5387768
DOI10.1007/978-3-540-77120-3_30zbMath1193.94053arXiv0705.0253OpenAlexW1501545949MaRDI QIDQ5387768
Publication date: 27 May 2008
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0705.0253
Analysis of algorithms and problem complexity (68Q25) Prefix, length-variable, comma-free codes (94A45)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- Code and parse trees for lossless source encoding
- Optimum '1'-ended binary prefix codes
- Huffman coding with unequal letter costs
- An efficient algorithm for constructing nearly optimal prefix codes
- Codes: Unequal Probabilities, Unequal Letter Cost
- Optimal Alphabetic Trees
- Binary prefix codes ending in a "1"
- 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
- Channels which transmit letters of unequal duration
- More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding
- A Method for the Construction of Minimum-Redundancy Codes
- Variable length tree structures having minimum average search time
- Simple proofs of some theorems on noiseless channels
This page was built for publication: More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding
