论文信息 - Existence of Perfect 3-Deletion-Correcting Codes

Existence of Perfect 3-Deletion-Correcting Codes

Bours [4] recently showed some constructions for perfect 2 and 3-deletion-correcting codes from combinatorial designs. He settled existence of perfect 2-deletion-correcting codes with words of length 4. However, the existence of perfect 3-deletion-correcting codes with words of length 5, or T*(2, 5, v), remained unsettled for v ≡ 7, 8 (mod 10) and v = 13, 14, 15, 16. In this paper we provide new constructions for these codes from combinatorial designs, and show that a T*(2, 5, v) exists for all v.

A. Mahmoodi | A. Mahmoodi

[1] N. S. Mendelsohn,et al. Directed Triple Systems , 1973, J. Comb. Theory, Ser. A.

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

[3] Jianxing Yin,et al. Directed packings with block size 5 and even ν , 1995, Des. Codes Cryptogr..

[4] Patrick A. H. Bours. On the construction of perfect deletion-correcting codes using design theory , 1995, Des. Codes Cryptogr..

[5] Haim Hanani,et al. Balanced incomplete block designs and related designs , 1975, Discret. Math..

[6] Hanfried Lenz,et al. Design theory , 1985 .

[7] Jennifer Seberry,et al. All DBIBDs with block size four exist , 1980 .

[8] Ahmed M. Assaf,et al. Directed packings with block size 5 and odd v , 1996, Australas. J Comb..

[9] David Benson Skillicorn. Directed packings and coverings with computer applications , 1981 .

[10] David B. Skillicorn,et al. All Directed BIBDs with k = 3 Exist , 1980, J. Comb. Theory, Ser. A.