Synchronization recovery of variable-length codes

The synchronization recovery property of variable-length (VL) codes has been extensively studied. In the paper, the mean error propagation length (MEPL) and the variance of error propagation length (VEPL), which are the secondary performance criteria of a VL code, are introduced to measure the synchronization recovery capability of a VL code. For the same probability distribution, there exist many different VL codes which have the same redundancy as the Huffman code but quite different MEPLs and VEPLs. To find one of the VL codes which has the minimum MEPL is a very difficult problem. We present two design algorithms for finding minimum-redundancy VL codes with short MEPL and VEPL. These two algorithms are simple and have the property that the codewords are assigned one by one. The efficiency of the algorithms are tested extensively by comparing the algorithms with known construction methods available in literature. Actually, VL codes obtained by the two algorithms outperform almost all codes available.

[1]  Alfredo De Santis,et al.  On the construction of statistically synchronizable codes , 1992, IEEE Trans. Inf. Theory.

[2]  Luisa Gargano,et al.  On the characterization of statistically synchronizable variable-length codes , 1988, IEEE Trans. Inf. Theory.

[3]  Wai-Man Lam,et al.  Extended Synchronizing Codewords for Binary Prefix Codes , 1993, Proceedings. IEEE International Symposium on Information Theory.

[4]  Stavros Konstantinidis,et al.  Error Corrections for Channels with Substitutions, Insertions, and Deletions , 1995, Information Theory and Applications.

[5]  Larry E. Stanfel New optimization models for designing synchronizing codes , 1990 .

[6]  Beulah Rudner Construction of minimum-redundance codes with an optimum synchronizing property , 1971, IEEE Trans. Inf. Theory.

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

[8]  Marcel Paul Schützenberger,et al.  On the Synchronizing Properties of Certain Prefix Codes , 1964, Inf. Control..

[9]  John P. Robinson,et al.  Error recovery for variable length codes , 1985, IEEE Trans. Inf. Theory.

[10]  Stephanie Perkins,et al.  Binary Huffman Equivalent Codes with a Short Synchronizing Codeword , 1998, IEEE Trans. Inf. Theory.

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

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

[13]  Julia Abrahams,et al.  Synchronization of binary source codes , 1986, IEEE Trans. Inf. Theory.

[14]  Marcel Paul Schützenberger,et al.  On Synchronizing Prefix Codes , 1967, Inf. Control..

[15]  M. Rahman,et al.  Effect of a Binary Symmetric Channel on the Synchronisations Recovery of Variable Length Codes , 1989, Comput. J..

[16]  J. J. Stiffler,et al.  Theory of synchronous communications , 1971 .

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

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

[19]  M. R. Titchener,et al.  Synchronisation process for the variable-length T-codes , 1986 .

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

[21]  S. Bende VARIABLE - LENGTH ENCODING , 1970 .

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

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

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

[25]  Michael E. Monaco,et al.  Corrections and additions to 'Error recovery for variable length codes' by J.C. Maxted and J.P. Robinson , 1987, IEEE Trans. Inf. Theory.

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

[27]  Larry E. Stanfel Mathematical Optimization and the Synchronizing Properties of Encodings , 1988, Inf. Comput..

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

[29]  Daniel S. Hirschberg,et al.  Data compression , 1987, CSUR.