论文信息 - On the analysis of variable-to-variable length codes

On the analysis of variable-to-variable length codes

We simplify the formula for the redundancy of a large class of variable-to-variable length codes on discrete, memoryless sources and find new asymptotic upper bounds on the redundancy of the Tunstall-Huffman code and the Tunstall-Shannon-Fano code.

W. Szpankowski | S.A. Savari

[1] Brian Parker Tunstall,et al. Synthesis of noiseless compression codes , 1967 .

[2] Frans M. J. Willems,et al. Variable to fixed-length codes for Markov sources , 1987, IEEE Trans. Inf. Theory.

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

[4] Frederick Jelinek,et al. Algorithms for Source Coding , 1975 .

[5] Serap A. Savari,et al. Variable-to-fixed length codes for predictable sources , 1998, Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225).

[6] Frederick Jelinek,et al. On variable-length-to-block coding , 1972, IEEE Trans. Inf. Theory.

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

[8] Serap A. Savari,et al. Generalized Tunstall codes for sources with memory , 1997, IEEE Trans. Inf. Theory.

[9] Wojciech Szpankowski,et al. Asymptotic average redundancy of Huffman (and other) block codes , 2000, IEEE Trans. Inf. Theory.

[10] Robert G. Gallager,et al. Variations on a theme by Huffman , 1978, IEEE Trans. Inf. Theory.

[11] W. Szpankowski. Average Case Analysis of Algorithms on Sequences , 2001 .

[12] Julia Abrahams,et al. Code and parse tree for lossless source encoding , 2001, Commun. Inf. Syst..

[13] Serap A. Savari. Variable-to-fixed length codes and the conservation of entropy , 1999, IEEE Trans. Inf. Theory.