Bidirectionally decodable streams of prefix code-words

A new general scheme is introduced that allows bidirectional decoding of variable length coded bitstreams from either end. Except for a small fixed number of extra bits appended to a sequence of code words, the scheme is as efficient as Huffman coding. The extra operations required at the coder and decoder are code word reversal and one EXOR for each bit.

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

[2]  J. Berstel,et al.  Theory of codes , 1985 .

[3]  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).

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

[5]  Thomas J. Ferguson,et al.  Self-synchronizing Huffman codes , 1984, IEEE Trans. Inf. Theory.

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

[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.

[8]  Peter G. Neumann,et al.  Efficient error-limiting variable-length codes , 1962, IRE Trans. Inf. Theory.

[9]  R. Talluri,et al.  Error-resilient video coding in the ISO MPEG-4 standard , 1998, IEEE Commun. Mag..

[10]  Shmuel Tomi Klein,et al.  Bidirectional Huffman Coding , 1990, Comput. J..

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