论文信息 - Sub-linear decoding of Huffman codes almost in-place - 字舞流文

Sub-linear decoding of Huffman codes almost in-place

We present a succinct data structure storing the Huffman encoding that permits sublinear decoding in the number of transmitted bits. The size of the extra storage except for the storage of the symb ...

Svante Carlsson | Andrej Brodnik

[1] Reza Hashemian. Memory efficient and high-speed search Huffman coding , 1995, IEEE Trans. Commun..

[2] Krishnendu Chakrabarty,et al. An Efficient Finite-State Machine Implementation of Huffman Decoders , 1997, Inf. Process. Lett..

[3] Lawrence L. Larmore,et al. A fast algorithm for optimal length-limited Huffman codes , 1990, JACM.

[4] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .

[5] Te Sun Han,et al. Huffman coding with an infinite alphabet , 1996, IEEE Trans. Inf. Theory.

[6] Alistair Moffat,et al. In-Place Calculation of Minimum-Redundancy Codes , 1995, WADS.

[7] David A. Huffman,et al. A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.

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

[9] Jeffrey Scott Vitter,et al. Algorithm 673: Dynamic Huffman coding , 1989, TOMS.

[10] Jeffrey Scott Vitter,et al. Design and analysis of dynamic Huffman codes , 1987, JACM.