Design considerations for efficient reversible variable length codes

This paper considers the properties reversible variable length codes (RVLCs) that are relevant for construction of highly efficient codes. We establish the dependency between the codeword section process and the efficiency-limiting parameters in the Huffman-code-based RVLC construction algorithm. Using this result, we propose an RVLC construction algorithm with a new codeword selection mechanism. The proposed algorithm yields RVLCs of higher efficiency relative to the other algorithms.

[1]  Y. Sergey.  Sufficient conditions of existence of fix-free codes , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[2]  On fix-free codes , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[3]  M. Wada,et al.  Reversible variable length codes , 1995, IEEE Trans. Commun..

[4]  Raymond W. Yeung,et al.  Some basic properties of fix-free codes , 2001, IEEE Trans. Inf. Theory.

[5]  John D. Villasenor,et al.  Reversible variable length codes for efficient and robust image and video coding , 1998, Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225).

[6]  Ja-Ling Wu,et al.  On constructing the Huffman-code-based reversible variable-length codes , 2001, IEEE Trans. Commun..

[7]  John D. Villasenor,et al.  A class of reversible variable length codes for robust image and video coding , 1997, Proceedings of International Conference on Image Processing.

[9]  Ja-Ling Wu,et al.  Modified symmetrical reversible variable-length code and its theoretical bounds , 2001, IEEE Trans. Inf. Theory.