Space-efficient Huffman codes revisited
From MaRDI portal
Recommendations
Cites work
- A Method for the Construction of Minimum-Redundancy Codes
- A fast algorithm for adaptive prefix coding
- A fast algorithm for optimal length-limited Huffman codes
- An almost optimal algorithm for unbounded searching
- An efficient decoding technique for Huffman codes
- Efficient and Compact Representations of Prefix Codes
- Efficient and compact representations of some non-canonical prefix-free codes
- Fusion trees can be implemented with \(AC^0\) instructions only
- Generating a canonical prefix encoding
- Huffman codes and self-information
- Memory efficient and high-speed search Huffman coding
- On the maximum length of Huffman codes
- Optimal Skeleton Huffman Trees Revisited
- Optimal lower and upper bounds for representing sequences
- Surpassing the information theoretic bound with fusion trees
- Towards optimal packed string matching
- Universal codeword sets and representations of the integers
Cited in
(3)
This page was built for publication: Space-efficient Huffman codes revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2094355)