Synchronization recovery techniques for binary cyclic codes

A class of binary block codes capable of simultaneous correction of additive errors and synchronization errors is presented. This class of codes consists of coset codes of binary cyclic or shortened cyclic codes, and retains the implementation advantages of binary cyclic codes. In most cases, the redundancy required to provide additive-error correction is sufficient to give synchronization-error correction so that no additional redundant bits are required. Synthesis procedures to construct such codes are also presented, along with an upper bound on the number of synchronization errors which can be corrected by codes in this class.

[1]  Peter G. Neumann.  On a class of efficient error-limiting variable-length codes , 1962, IRE Trans. Inf. Theory.

[2]  A. H. Frey.  Message Framing and Error Control , 1965, IEEE Transactions on Military Electronics.

[3]  Jack J. Stiffler,et al.  Comma-free error-correcting codes , 1965, IEEE Trans. Inf. Theory.

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

[5]  J. J. Stiffler.  Synchronization of Telemetry Codes , 1962, IRE Transactions on Space Electronics and Telemetry.

[6]  Frederick F. Sellers,et al.  Bit loss and gain correction code , 1962, IRE Trans. Inf. Theory.

[7]  Dwijendra K. Ray-Chaudhuri,et al.  Binary mixture flow with free energy lattice Boltzmann methods , 2022, arXiv.org.

[8]  Neal Zierler,et al.  Two-Error Correcting Bose-Chaudhuri Codes are Quasi-Perfect , 1960, Inf. Control..

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