On the construction of statistically synchronizable codes

The problem of constructing statistically synchronizable codes over arbitrary alphabets and for any finite source is considered. It is shown how to efficiently construct a statistically synchronizable code whose average codeword length is within the least likely codeword probability from that of the Huffman code for the same source. Moreover, a method is given for constructing codes having a synchronizing codeword. The method yields synchronous codes that exhibit high synchronizing capability and low redundancy. >

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

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

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

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

[5]  R. Gallager.  Information Theory and Reliable Communication , 1968 .

[6]  Edgar N. Gilbert,et al.  Synchronization of binary messages , 1960, IRE Trans. Inf. Theory.

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

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

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

[10]  Robert A. Scholtz,et al.  Mechanization of codes with bounded synchronization delays , 1970, IEEE Trans. Inf. Theory.

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

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

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

[14]  Toby Berger,et al.  Optimum '1' ended binary prefix codes , 1990, IEEE Trans. Inf. Theory.

[15]  Robert A. Scholtz,et al.  Block codes for statistical synchronization , 1970, IEEE Trans. Inf. Theory.

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

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

[18]  Basil Gordon,et al.  Codes With Bounded Synchronization Delay , 1965, Inf. Control..

[19]  Vladimir I. Levenshtein.  Certain Properties of Code Systems , 1962 .

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

[21]  Dietrich Manstetten.  Tight bounds on the redundancy of Huffman codes , 1992, IEEE Trans. Inf. Theory.

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

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

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

[25]  Robert M. Gray,et al.  Theory of synchronous communications : J.J. Stiffler. 562 pages, diagrams, 6 x 9 in. Englewood Cliffs, New Jersey, Prentice-Hall, 1971. Price, $16.95 (approx. £6·55). , 1973 .