Pages that link to "Item:Q3477965"
From MaRDI portal
The following pages link to A fast algorithm for optimal length-limited Huffman codes (Q3477965):
Displaying 17 items.
- Exact and approximation algorithms for error-detecting even codes (Q441883) (← links)
- Is Huffmann coding dead? (Q685866) (← links)
- Solving sequential knapsack problems (Q688211) (← links)
- Shortest synchronizing strings for Huffman codes (Q837184) (← links)
- Trees with exponentially growing costs (Q924721) (← links)
- Correctness of constructing optimal alphabetic trees revisited (Q1390875) (← links)
- Decision trees for function evaluation: simultaneous optimization of worst and expected cost (Q1679228) (← links)
- Trading off worst and expected cost in decision tree problems (Q1679235) (← links)
- Space-efficient Huffman codes revisited (Q2094355) (← links)
- Generation of fast interpreters for Huffman compressed bytecode (Q2566230) (← links)
- Fixed-prefix encoding of the integers can be Huffman-optimal (Q3489930) (← links)
- Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code (Q3630217) (← links)
- (Q3719826) (← links)
- An application of the Hopfield model to Huffman codes (Q4277173) (← links)
- Parity codes (Q4680739) (← links)
- Optimal binary search trees (Q5906917) (← links)
- A fast and space-economical algorithm for length-limited coding (Q6487940) (← links)