scientific article; zbMATH DE number 3558968
From MaRDI portal
Publication:4131006
Cited in
(16)- Huffman's algorithm via algebra
- Minimax trees in linear time with applications
- Optimal prefix codes with fewer distinct codeword lengths are faster to construct
- Approximating Huffman codes in parallel
- Exact and approximation algorithms for error-detecting even codes
- Practical algorithms for generating a random ordering of the elements of a weighted set
- Optimal Skeleton Huffman Trees Revisited
- In-place calculation of minimum-redundancy codes
- Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees
- A fast and space-economical algorithm for length-limited coding
- Is Huffmann coding dead?
- Huffman coding with non-sorted frequencies
- Simple worst-case optimal adaptive prefix-free coding
- Old and new results on alphabetic codes
- Faster linear-size \textsc{and}-\textsc{or} path and adder circuits
- Trees with exponentially growing costs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4131006)
