Pages that link to "Item:Q4701156"
From MaRDI portal
The following pages link to A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs (Q4701156):
Displaying 8 items.
- On the construction of prefix-free and fix-free codes with specified codeword compositions (Q765325) (← links)
- Dynamic Shannon coding (Q845979) (← links)
- Trees with exponentially growing costs (Q924721) (← links)
- The \(S\)-digraph optimization problem and the greedy algorithm (Q1019296) (← links)
- Optimal point-to-point broadcast algorithms via lopsided trees (Q1296579) (← links)
- Generalized Huffman coding for binary trees with choosable edge lengths (Q2512825) (← links)
- Speeding up the AIFV-2 dynamic programs by two orders of magnitude using range minimum queries (Q2661782) (← links)
- More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding (Q5387768) (← links)
