The following pages link to (Q4131006):
Displaying 13 items.
- Exact and approximation algorithms for error-detecting even codes (Q441883) (← links)
- Practical algorithms for generating a random ordering of the elements of a weighted set (Q489756) (← links)
- Is Huffmann coding dead? (Q685866) (← links)
- Huffman coding with non-sorted frequencies (Q691643) (← links)
- Trees with exponentially growing costs (Q924721) (← links)
- Huffman's algorithm via algebra (Q1168073) (← links)
- Minimax trees in linear time with applications (Q1761500) (← links)
- Optimal prefix codes with fewer distinct codeword lengths are faster to construct (Q2272991) (← links)
- Approximating Huffman codes in parallel (Q2466011) (← links)
- Optimal Skeleton Huffman Trees Revisited (Q5042248) (← links)
- In-place calculation of minimum-redundancy codes (Q5057451) (← links)
- Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees (Q5958114) (← links)
- A fast and space-economical algorithm for length-limited coding (Q6487940) (← links)
