Space-efficient Huffman codes revisited
From MaRDI portal
Publication:2094355
DOI10.1016/j.ipl.2022.106274OpenAlexW3191261959MaRDI QIDQ2094355
Dominik Köppl, Szymon Grabowski
Publication date: 28 October 2022
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.05495
Cites Work
- An almost optimal algorithm for unbounded searching
- Fusion trees can be implemented with \(AC^0\) instructions only
- Surpassing the information theoretic bound with fusion trees
- An efficient decoding technique for Huffman codes
- On the maximum length of Huffman codes
- A fast algorithm for adaptive prefix coding
- Towards optimal packed string matching
- Memory efficient and high-speed search Huffman coding
- Efficient and Compact Representations of Prefix Codes
- A fast algorithm for optimal length-limited Huffman codes
- Universal codeword sets and representations of the integers
- Huffman codes and self-information
- Optimal Lower and Upper Bounds for Representing Sequences
- Optimal Skeleton Huffman Trees Revisited
- Generating a canonical prefix encoding
- A Method for the Construction of Minimum-Redundancy Codes
- Efficient and compact representations of some non-canonical prefix-free codes
