On error detection and error synchronization of reversible variable-length codes

Reversible variable-length codes (RVLCs) are not only prefix-free but also suffix-free codes. Due to the additional suffix-free condition, RVLCs are usually nonexhaustive codes. When a bit error occurs in a sentence from a nonexhaustive RVLC, it is possible that the corrupted sentence is not decodable. The error is said to be detected in this case. We present a model for analyzing the error detection and error synchronization characteristics of nonexhaustive VLCs. Six indices, the error detection probability, the mean and the variance of forward error detection delay length, the error synchronization probability, the mean and the variance of forward error synchronization delay length are formulated based on this model. When applying the proposed model to the case of nonexhaustive RVLCs, these formulations can be further simplified. Since RVLCs can be decoded in backward direction, the mean and the variance of backward error detection delay length, the mean and the variance of backward error synchronization delay length are also introduced as measures to examine the error detection and error synchronization characteristics of RVLCs. In addition, we found that error synchronization probabilities of RVLCs with minimum block distance greater than 1 are 0.

[1]  John D. Villasenor,et al.  An algorithm for construction of efficient fix-free codes , 2003, IEEE Communications Letters.

[2]  Peter F. Swaszek,et al.  More on the error recovery for variable-length codes , 1995, IEEE Trans. Inf. Theory.

[3]  M. Schutzenberger,et al.  On an application of semi groups methods to some problems in coding , 1956 .

[4]  Zhen Zhang,et al.  Synchronization recovery of variable-length codes , 2002, IEEE Trans. Inf. Theory.

[5]  E. F. Moore,et al.  Variable-length binary encodings , 1959 .

[6]  Ja-Ling Wu,et al.  Generic construction algorithms for symmetric and asymmetric RVLCs , 2002, The 8th International Conference on Communication Systems, 2002. ICCS 2002..

[7]  Patrick G. Farrell,et al.  Variable-length error-correcting codes , 2000 .

[8]  Marcel Paul Schützenberger,et al.  ON an APPIICATICN , 1998 .

[9]  Victor Buttigieg,et al.  On variable-length error-correcting codes , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

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

[11]  Robert A. Scholtz,et al.  On the characterization of statistically synchronizable codes (Corresp.) , 1980, IEEE Trans. Inf. Theory.

[12]  John D. Villasenor,et al.  On design of error-correcting reversible variable length codes , 2002, IEEE Communications Letters.

[13]  S. Louis Hakimi,et al.  Graph Theoretic Prefix Codes and Their Synchronizing Properties , 1969, Inf. Control..

[14]  Mark R. Titchener The synchronization of variable-length codes , 1997, IEEE Trans. Inf. Theory.

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

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

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

[18]  Yasuhiro Takishima,et al.  Error states and synchronization recovery for variable length codes , 1994, IEEE Trans. Commun..

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

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