论文信息 - Efficient decoding of prefix codes

Efficient decoding of prefix codes

A special case of the data compression problem is presented, in which a powerful encoder transmits a coded file to a decoder that has severely constrained memory. A data structure that achieves minimum storage is presented, and alternative methods that sacrifice a small amount of storage to attain faster decoding are described.

Daniel S. Hirschberg | Debra A. Lelewer | D. A. Lelewer | D. Hirschberg

[1] Daniel S. Hirschberg,et al. Data compression , 1987, CSUR.

[2] J. B. Connell,et al. A Huffman-Shannon-Fano code , 1973 .

[3] Eugene S. Schwartz,et al. Generating a canonical prefix encoding , 1964, CACM.

[4] Ian H. Witten,et al. Arithmetic coding for data compression , 1987, CACM.

[5] M. Hankamer. A Modified Huffman Procedure with Reduced Memory Requirement , 1979, IEEE Trans. Commun..

[6] Hatsukazu Tanaka,et al. Data structure of Huffman codes and its application to efficient encoding and decoding , 1987, IEEE Trans. Inf. Theory.

[7] Andrzej Sieminski,et al. Fast Decoding of the Huffman Codes , 1988, Inf. Process. Lett..

[8] D. Huffman. A Method for the Construction of Minimum-Redundancy Codes , 1952 .

[9] James A. Storer,et al. Data Compression: Methods and Theory , 1987 .

[10] Alberto Apostolico,et al. Robust transmission of unbounded strings using Fibonacci representations , 1987, IEEE Trans. Inf. Theory.