Nonasymptotic Upper Bounds for Deletion Correcting Codes

Explicit nonasymptotic upper bounds on the sizes of multiple-deletion correcting codes are presented. In particular, the largest single-deletion correcting code for q-ary alphabet and string length is shown to be of size at most (qn-q)/{(q-1)(n-1)}. An improved bound on the asymptotic rate function is obtained as a corollary. Upper bounds are also derived on sizes of codes for a constrained source that does not necessarily comprise of all strings of a particular length, and this idea is demonstrated by application to sets of run-length limited strings. The problem of finding the largest deletion correcting code is modeled as a matching problem on a hypergraph. This problem is formulated as an integer linear program. The upper bound is obtained by the construction of a feasible point for the dual of the linear programming relaxation of this integer linear program. The nonasymptotic bounds derived imply the known asymptotic bounds of Levenshtein and Tenengolts and improve on known nonasymptotic bounds. Numerical results support the conjecture that in the binary case, the Varshamov-Tenengolts codes are the largest single-deletion correcting codes.

[1]  Martin J. Wainwright,et al.  Using linear programming to Decode Binary linear codes , 2005, IEEE Transactions on Information Theory.

[2]  Yashodhan Kanoria,et al.  On the deletion channel with small deletion probability , 2009, 2010 IEEE International Symposium on Information Theory.

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

[4]  E. Scheinerman,et al.  Fractional Graph Theory: A Rational Approach to the Theory of Graphs , 1997 .

[5]  Dennis G. Howe,et al.  Shift error correcting modulation codes , 1991 .

[6]  Patrick A. H. Bours,et al.  Construction of fixed-length insertion/deletion correcting runlength-limited codes , 1994, IEEE Trans. Inf. Theory.

[7]  Negar Kiyavash,et al.  An algorithmic approach for finding deletion correcting codes , 2011, 2011 IEEE Information Theory Workshop.

[8]  Hendrik C. Ferreira,et al.  A note on double insertion/deletion correcting codes , 2003, IEEE Trans. Inf. Theory.

[9]  V. Levenshtein.  On perfect codes in deletion and insertion metric , 1992 .

[10]  Eiichi Tanaka,et al.  Synchronization and substitution error-correcting codes for the Levenshtein metric , 1976, IEEE Trans. Inf. Theory.

[11]  Daniel Cullina,et al.  A coloring approach to constructing deletion correcting codes from constant weight subgraphs , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[12]  David Sankoff,et al.  Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison , 1983 .

[13]  Khaled A. S. Abdel-Ghaffar,et al.  On Helberg's Generalization of the Levenshtein Code for Multiple Deletion/Insertion Error Correction , 2012, IEEE Transactions on Information Theory.

[14]  Panos M. Pardalos,et al.  Finding maximum independent sets in graphs arising from coding theory , 2002, SAC '02.

[15]  Jeffrey D. Ullman,et al.  On the capabilities of codes to correct synchronization errors , 1967, IEEE Trans. Inf. Theory.

[16]  Paul H. Siegel,et al.  Lee-metric BCH codes and their application to constrained and partial-response channels , 1994, IEEE Trans. Inf. Theory.

[17]  Zoltán Füredi,et al.  Maximum degree and fractional matchings in uniform hypergraphs , 1981, Comb..

[18]  Vladimir I. Levenshtein,et al.  Efficient Reconstruction of Sequences from Their Subsequences or Supersequences , 2001, J. Comb. Theory A.

[19]  Vahid Tarokh,et al.  A survey of error-correcting codes for channels with symbol synchronization errors , 2010, IEEE Communications Surveys & Tutorials.

[20]  R. R. Varshamov,et al.  A class of codes for asymmetric channels and a problem from the additive theory of numbers , 1973, IEEE Trans. Inf. Theory.

[21]  Lorenzo Calabi,et al.  Some General Results of Coding Theory with Applications to the Study of Codes for the Correction of Synchronization Errors , 1969, Inf. Control..

[22]  Mireille Régnier,et al.  Tight Bounds on the Number of String Subsequences DANIEL S , 2000 .

[23]  G. Tenengolts,et al.  Nonbinary codes, correcting single deletion or insertion , 1984, IEEE Trans. Inf. Theory.

[24]  V. I. Levenshtein,et al.  Bounds for deletion/insertion correcting codes , 2002, Proceedings IEEE International Symposium on Information Theory,.

[25]  David Zuckerman,et al.  Asymptotically good codes correcting insertions, deletions, and transpositions , 1997, SODA '97.

[26]  Axthonv G. Oettinger,et al.  IEEE Transactions on Information Theory , 1998 .

[27]  Majid Khabbazian,et al.  On the Number of Subsequences When Deleting Symbols From a String , 2008, IEEE Transactions on Information Theory.

[28]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[29]  Vladimir I. Levenshtein,et al.  Efficient reconstruction of sequences , 2001, IEEE Trans. Inf. Theory.

[30]  Hunter S. Snevily.  Combinatorics of finite sets , 1991 .

[31]  Michael Langberg,et al.  A Characterization of the Number of Subsequences Obtained via the Deletion Channel , 2015, IEEE Transactions on Information Theory.

[32]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[33]  N.J.A. Sloane,et al.  On Single-Deletion-Correcting Codes , 2002, math/0207197.

[34]  Ron Holzman,et al.  On a theorem of lovász on covers inr-partite hypergraphs , 1996, Comb..

[35]  Hendrik C. Ferreira,et al.  On multiple insertion/Deletion correcting codes , 2002, IEEE Trans. Inf. Theory.

[36]  Michael Mitzenmacher,et al.  Polynomial Time Low-Density Parity-Check Codes With Rates Very Close to the Capacity of the $q$-ary Random Deletion Channel for Large $q$ , 2006, IEEE Transactions on Information Theory.

[37]  Suhas N. Diggavi,et al.  Capacity Upper Bounds for the Deletion Channel , 2007, 2007 IEEE International Symposium on Information Theory.

[38]  Khaled A. S. Abdel-Ghaffar,et al.  A Multiple Insertion/Deletion Correcting Code for Run-Length Limited Sequences , 2012, IEEE Transactions on Information Theory.

[39]  Ron Holzman,et al.  On a theorem of lovsz on covers in r -partite hypergraphs , 1996 .

[40]  Ling Cheng,et al.  Moment Balancing Templates for $(d,k)$-Constrained Codes and Run-Length Limited Sequences , 2010, IEEE Transactions on Information Theory.

[41]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

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