Efficient decoding of compressed data
โ
Bassiouni, Mostafa A. ;Mukherjee, Amar
๐
Article
๐
1995
๐
John Wiley and Sons
๐
English
โ 944 KB
In this article, we discuss the problem of enhancing the speed of Huffman decoding. One viable solution to this problem is the multibit scheme which uses the concept of k-bit trees to decode up to k bits at a time. A linear-time optimal solution for the mapping of 2-bit trees into memory is presente