A note on double insertion/deletion correcting codes

By using a run-length representation of sequences, ways to determine suband supersequences are discussed. This is then used in determining the number of sub- and supersequences of a sequence after double insertions or deletions. It is also used in creating subsequence/supersequence books that are searched to find new double insertion/deletion correcting code books with higher cardinalities than those already known.

[1]  Tamotsu Kasai,et al.  A Method for the Correction of Garbled Words Based on the Levenshtein Metric , 1976, IEEE Transactions on Computers.

[2]  David J. C. MacKay,et al.  Reliable communication over channels with insertions, deletions, and substitutions , 2001, IEEE Trans. Inf. Theory.

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

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

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

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

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

[8]  Daniel S. Hirschberg,et al.  Bounds on the Number of String Subsequences , 1999, CPM.

[9]  M. Blaum,et al.  Methods for synchronizing (d,k)-constrained sequences , 1994, Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications.

[10]  M. Luby,et al.  Asymptotically Good Codes Correcting Insertions, Deletions, and Transpositions , 1999 .

[11]  Kenneth G. Paterson,et al.  Computing the error linear complexity spectrum of a binary sequence of period 2n , 2003, IEEE Trans. Inf. Theory.

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

[13]  K. T. Arasu,et al.  On single-deletion-correcting codes , 2002 .

[14]  H. C. Ferreira,et al.  On multiple insertion/deletion correcting codes , 1994, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[15]  Khaled A. S. Abdel-Ghaffar,et al.  Insertion/deletion correction with spectral nulls , 1997, IEEE Trans. Inf. Theory.

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