Spectrum of sizes for perfect deletion-correcting codes

SIAM Journal on Discrete Mathematics

Volumn 24, Issue 1, 2010, Pages 33-55

  Chee, Yeow Meng ^a   Ge, Gennian ^b   Ling, Alan C H ^c  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b ZHEJIANG UNIVERSITY   (China)

^c University of Vermont ^*  (United States)

Author keywords

Deletion correcting codes; Directed packings; Group divisible designs; Optimal codes; Perfect codes

Indexed keywords

DELETION-CORRECTING; DIRECTED PACKING; GROUP DIVISIBLE DESIGN; OPTIMAL CODES; PERFECT CODES;

OPTIMIZATION;

EID: 77952469930     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/090751311     Document Type: Article

References (57)

1. R. J. R. Abel, A. E. Brouwer, C. J. Colbourn, and J. H. Dinitz, Mutually orthogonal Latin squares (MOLS), in The CRC Handbook of Combinatorial Designs, C. J. Colbourn and J. H. Dinitz, eds., CRC Press, Boca Raton, FL, 1996, pp. 97-184.
2. A. M. Assaf and A. Hartman, Resolvable group divisible designs with block size 3, Discrete Math., 77 (1989), pp. 5-20.
3. A. M. Assaf, N. Shalaby, and J. Yin, Directed packing and covering designs with block size four, Discrete Math., 238 (2001), pp. 3-17.
4. F. E. Bennett, R. Wei, J. Yin, and A. Mahmoodi, Existence of DBIBDs with block size six, Utilitas Math., 43 (1993), pp. 205-217.
5. P. A. H. Bours, Construction of fixed-length insertion/deletion correcting runlength-limited codes, IEEE Trans. Inform. Theory, 40 (1994), pp. 1841-1856.
6. P. A. H. Bours, On the construction of perfect deletion-correcting codes using design theory, Des. Codes Cryptogr., 6 (1995), pp. 5-20.
7. A. E. Brouwer, Optimal packings of K4's into a Kn, J. Combin. Theory Ser. A, 26 (1979), pp. 278-297.
8. A. E. Brouwer, A. Schrijver, and H. Hanani, Group divisible designs with block-size four, Discrete Math., 20 (1977), pp. 1-10.
9. L. Calabi and W. E. Hartnett, A family of codes for the correction of substitution and synchronization errors, IEEE Trans. Inform. Theory, IT-15 (1969), pp. 102-106.
10. L. Calabi and W. E. Hartnett, Some general results of coding theory with applications to the study of codes for the correction of synchronization errors, Information and Control, 15 (1969), pp. 235-249.
11. C. J. Colbourn, D. G. Hoffman, and R. Rees, A new class of group divisible designs with block size three, J. Combin. Theory Ser. A, 59 (1992), pp. 73-89.
12. C. J. Colbourn and A. Rosa, Directed and Mendelsohn triple systems, in Contemporary Design Theory, J. H. Dinitz and D. R. Stinson, eds., Wiley-Intersci. Ser. Discrete Math. Optim., John Wiley, New York, 1992, pp. 97-136.
13. M. C. Davey and D. J. C. MacKay, Reliable communication over channels with insertions, deletions, and substitutions, IEEE Trans. Inform. Theory, 47 (2001), pp. 687-698.
14. L. Dolecek and V. Anantharam, Using Reed-Muller RM(1,m) codes over channels with synchronization and substitution errors, IEEE Trans. Inform. Theory, 53 (2007), pp. 1430- 1443.
15. R. Fuji-Hara, Y. Miao, J. Wang, and J. Yin, Directed B(K, 1; v) with K = {4, 5} and {4, 6} related to deletion/insertion-correcting codes, J. Combin. Des., 9 (2001), pp. 147-156.
16. S. Furino, Y. Miao, and J. Yin, Frames and Resolvable Designs, CRC Press Ser. Discrete Math. Appl., CRC Press, Boca Raton, FL, 1996.
17. G. Ge and A. C. H. Ling, Group divisible designs with block size four and group type gum1 for small g, Discrete Math., 285 (2004), pp. 97-120.
18. G. Ge and R. Rees, On group-divisible designs with block size four and group-type 6um1, Discrete Math., 279 (2004), pp. 247-265.
19. H. Hanani, Balanced incomplete block designs and related designs, Discrete Math., 11 (1975), pp. 255-369.
20. J. J. Harms and C. J. Colbourn, An efficient algorithm for directing triple systems, Congr. Numer., 39 (1983), pp. 455-461.
21. J. J. Harms and C. J. Colbourn, An optimal algorithm for directing triple systems using Eulerian circuits, in Cycles in Graphs (Burnaby, B.C., 1982), North-Holland Math. Stud. 115, North-Holland, Amsterdam, 1985, pp. 433-438.
22. H. Heijink, L. Windsor, and P. Desain, Data processing in music performance research: Using structural information to improve score performance matching, Behav. Res. Methods Instrum. Comput., 32 (2000), pp. 546-554.
23. S. H. Y. Hung and N. S. Mendelsohn, Directed triple systems, J. Combin. Theory Ser. A, 14 (1973), pp. 310-318.
24. S. M. Johnson, A new upper bound for error-correcting codes, IRE Trans. Inform. Theory, 8 (1962), pp. 203-207.
25. A. Klein, On perfect deletion-correcting codes, J. Combin. Des., 12 (2004), pp. 72-77.
26. V. I. Levenshteîn, Binary codes capable of correcting deletions, insertions, and reversals, Soviet Phys. Dokl., 10 (1965), pp. 707-710.
27. V. I. Levenshteîn, Binary codes capable of correcting spurious insertions and deletions of ones, Problems Inform. Transmission, 1 (1965), pp. 8-17.
28. V. I. Levenshteîn, Perfect codes in the metric of deletions and insertions, Diskret. Mat., 3 (1991), pp. 3-20.
29. A. Mahmoodi, Existence of perfect 3-deletion-correcting codes, Des. Codes Cryptogr., 14 (1998), pp. 81-87.
30. M. Marron, K. M. Swenson, and B. M. E. Moret, Genomic distances under deletions and insertions, in Computing and Combinatorics, Lecture Notes in Comput. Sci. 2697, Springer, Berlin, 2003, pp. 537-547.
31. L. McAven and R. Safavi-Naini, Classification of the deletion correcting capabilities of Reed- Solomon codes of dimension 2 over prime fields, IEEE Trans. Inform. Theory, 53 (2007), pp. 2280-2294.
32. C. Palmer and C. van de Sande, Units of knowledge in music performance, J. Exp. Psychol. Learn. Mem. Cogn., 19 (1993), pp. 457-470.
33. C. W. Pratt and K. Cornely, Essential Biochemistry, John Wiley & Sons, New York, 2004.
34. E. A. Ratzer, Marker codes for channels with insertions and deletions, Annales des Télécommunications, 60 (2005), pp. 29-44.
35. R. Rees and D. R. Stinson, On resolvable group-divisible designs with block size 3, Ars Combin., 23 (1987), pp. 107-120.
36. R. S. Rees, Two new direct product-type constructions for resolvable group-divisible designs, J. Combin. Des., 1 (1993), pp. 15-26.
37. R. M. Roth and P. H. Siegel, Lee-metric BCH codes and their application to constrained and partial-response channels, IEEE Trans. Inform. Theory, 40 (1994), pp. 1083-1096.
38. D. G. Sarvate, Some results on directed and cyclic designs, Ars Combin., 19 (1985), pp. 179- 190.
39. J. Schönheim, On maximal systems of k-tuples, Studia Sci. Math. Hungar., 1 (1966), pp. 363- 368.
40. L. J. Schulman and D. Zuckerman, Asymptotically good codes correcting insertions, deletions, and transpositions, IEEE Trans. Inform. Theory, 45 (1999), pp. 2552-2557.
41. F. F. Sellers, Jr., Bit loss and gain correction code, IRE Trans., IT-8 (1962), pp. 35-38.
42. N. Shalaby, J. Wang, and J. Yin, Existence of perfect 4-deletion-correcting codes with length six, Des. Codes Cryptogr., 27 (2002), pp. 145-156.
43. D. B. Skillicorn, Directed packings of pairs into quadruples, J. Austral. Math. Soc. Ser. A, 33 (1982), pp. 179-184.
44. N. J. A. Sloane, On single-deletion-correcting codes, in Codes and Designs (Columbus, OH, 2000), Ohio State Univ. Math. Res. Inst. Publ. 10, de Gruyter, Berlin, 2002, pp. 273-291.
45. D. J. Street and J. Seberry, All DBIBDs with block size four exist, Utilitas Math., 18 (1980), pp. 27-34.
46. D. J. Street and W. H. Wilson, On directed balanced incomplete block designs with block size five, Utilitas Math., 18 (1980), pp. 161-174.
47. T. G. Swart and H. C. Ferreira, A note on double insertion/deletion correcting codes, IEEE Trans. Inform. Theory, 49 (2003), pp. 269-273.
48. G. Tenengolts, Nonbinary codes, correcting single deletion or insertion, IEEE Trans. Inform. Theory, 30 (1984), pp. 766-769.
49. D. Tonien and R. Safavi-Naini, Construction of deletion correcting codes using generalized Reed-Solomon codes and their subcodes, Des. Codes Cryptogr., 42 (2007), pp. 227-237.
50. J. D. Ullman, Near-optimal, single-synchronization-error-correcting code, IEEE Trans. Inform. Theory, 12 (1966), pp. 418-424.
51. J. D. Ullman, On the capabilities of codes to correct synchronization errors, IEEE Trans. Inform. Theory, 13 (1967), pp. 95-105.
52. R. R. Varshamov and G. M. Tenengolts, Codes which correct single asymmetric errors, Automat. Remote Control, 26 (1965), pp. 286-290.
53. J. Wang, Some combinatorial constructions for optimal perfect deletion-correcting codes, Des. Codes Cryptogr., 48 (2008), pp. 331-347.
54. J. Wang and J. Yin, Constructions for perfect 5-deletion-correcting codes of length 7, IEEE Trans. Inform. Theory, 52 (2006), pp. 3676-3685.
55. Y. Wang, L. McAven, and R. Safavi-Naini, Deletion correcting using generalized Reed- Solomon codes, in Coding, Cryptography and Combinatorics, Progr. Comput. Sci. Appl. Logic 23, Birkhäuser, Basel, 2004, pp. 345-358.
56. J. Yin, A combinatorial construction for perfect deletion-correcting codes, Des. Codes Cryptogr., 23 (2001), pp. 99-110.
57. L. Zhu, Some recent developments on BIBDs and related designs, Discrete Math., 123 (1993), pp. 189-214.