Insertion/deletion correction with spectral nulls

Levenshtein (1966) proposed a class of single insertion/deletion correcting codes, based on the number-theoretic construction due to Varshamov and Tenengolt's (1965). We present several interesting results on the binary structure of these codes, and their relation to constrained codes with nulls in the power spectral density function. One surprising result is that the higher order spectral null codes of Immink and Beenker (1987) are sub-codes of balanced Levenshtein codes. Other spectral null sub-codes with similar coding rates, may also be constructed. We furthermore present some coding schemes and spectral shaping markers which alleviate the fundamental restriction on Levenshtein's codes that the boundaries of each codeword should be known before insertion/deletion correction can be effected.

[1]  John Riordan,et al.  Introduction to Combinatorial Analysis , 1958 .

[2]  H. C. Ferreira.  Lower bounds on the minimum hamming distance achievable with runlengh constrained or DC free block codes and the synthesis of a (16,8) D min = 4 DC free block code , 1984 .

[3]  Philippe Piret,et al.  Spectral Enumerators for Certain Additive-Error-Correcting Codes over Integer Alphabets , 1981, Inf. Control..

[4]  L. Dickson.  History of the Theory of Numbers , 1924, Nature.

[5]  Vladimir I. Levenshtein,et al.  Binary codes capable of correcting deletions, insertions, and reversals , 1965 .

[6]  N. J. A. Sloane,et al.  Lower bounds for constant weight codes , 1980, IEEE Trans. Inf. Theory.

[7]  John Riordan,et al.  Introduction to Combinatorial Analysis , 1959 .

[8]  Mario Blaum.  A (16, 9, 6, 5, 4) error-correcting DC free block code , 1988, IEEE Trans. Inf. Theory.

[9]  Kees A. Schouhamer Immink,et al.  Binary transmission codes with higher order spectral zeros at zero frequency , 1987, IEEE Trans. Inf. Theory.

[10]  D. N. Lehmer.  Dickson's History of the Theory of Numbers , 1920 .

[11]  N. J. A. Sloane,et al.  A new table of constant weight codes , 1990, IEEE Trans. Inf. Theory.

[12]  Kees Schouhamer-Immink.  Coding Techniques for Digital Recorders , 1991 .

[13]  Jeffrey D. Ullman,et al.  Near-optimal, single-synchronization-error-correcting code , 1966, IEEE Trans. Inf. Theory.

[14]  William H. Kautz,et al.  Single-error-correcting codes for constant-weight data words , 1965, IEEE Trans. Inf. Theory.

[15]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[16]  H. C. Ferreira,et al.  A class of dc free synchronization-error correcting codes , 1993, [1993] Digests of International Magnetics Conference.

[17]  Jae-Kyoon Kim,et al.  A Condition for Stable Minimum-Bandwidth Line Codes , 1985, IEEE Trans. Commun..

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

[19]  Tor Helleseth,et al.  On Group-Theoretic Codes for Assymmetric Channels , 1981, Inf. Control..