Space-efficient Huffman codes revisited

DOI10.1016/J.IPL.2022.106274MaRDI QIDQ2094355zbMATH OpenOpenAlexFDO

Authors Szymon Grabowski, Dominik Köppl

Publication date 28 October 2022

Published in Information Processing Letters (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2108.05495

zbMATH Keywords

data structuresdata compressionHuffman codecompact representationcanonical code

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Efficient and compact representations of some non-canonical prefix-free codes
• Efficient and compact representations of some non-canonical prefix-free codes
• scientific article; zbMATH DE number 2170434
• An efficient decoding technique for Huffman codes
• In-place calculation of minimum-redundancy codes

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)

• A space-efficient Huffman decoding algorithm and its parallelism
• Space-Efficient Huffman Codes Revisited
• An efficient bitwise Huffman coding technique based on source mapping.

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)