Fast decoding of the Huffman codes

Authors:
Andrzej Siemiński
Affiliations:
Technical University of Wroclaw, Wroclaw, Poland
Venue:
Information Processing Letters
Year:
1988

Citing 0
Cited 3

Efficient decoding of prefix codes

Communications of the ACM
Skeleton Trees for the Efficient Decoding of Huffman Encoded Texts

Information Retrieval
A lossless data compression and decompression algorithm and its hardware architecture

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	0.91

Visualization

Abstract