A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs
From MaRDI portal
Publication:4645183
DOI10.1007/3-540-60084-1_79zbMATH Open1412.68083OpenAlexW2075346951MaRDI QIDQ4645183FDOQ4645183
Authors: 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
Recommendations
- A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs
- Faster algorithm for designing optimal prefix-free codes with unequal letter costs
- Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
- scientific article; zbMATH DE number 1305081
- Prefix Codes: Equiprobable Words, Unequal Letter Costs
Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Codes: Unequal Probabilities, Unequal Letter Cost
- Optimum lopsided binary trees
- Efficient Generation of Optimal Prefix Code
- Title not available (Why is that?)
- Tree Structures for Optimal Searching
- Prefix Codes: Equiprobable Words, Unequal Letter Costs
Cited In (14)
- Algorithms and Data Structures
- Algorithms – ESA 2004
- Optimum extensions of prefix codes.
- More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding
- Faster algorithm for designing optimal prefix-free codes with unequal letter costs
- A generic top-down dynamic-programming approach to prefix-free coding
- Optimal prefix free codes with partial sorting
- On the construction of prefix-free and fix-free codes with specified codeword compositions
- More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding
- Huffman coding with letter costs: a linear-time approximation scheme
- Title not available (Why is that?)
- A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes
- Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
- Three space-economical algorithms for calculating minimum-redundancy prefix codes
This page was built for publication: A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645183)
