Constructions for perfect 5-deletion-correcting codes of Length 7

IEEE Transactions on Information Theory

Volumn 52, Issue 8, 2006, Pages 3676-3685

  Wang, Jianmin ^a   Yin, Jianxing ^a  

^a SOOCHOW UNIVERSITY   (China)

Author keywords

Deletion insertion correcting code; Design; Directed; Directed balanced incomplete block design (DBIBD); Perfect deletion correcting code

Indexed keywords

MATHEMATICAL MODELS; NUMBER THEORY; SET THEORY;

DIRECTED BALANCED INCOMPLETE BLOCK DESIGN (DBIBD); INSERTION-CORRECTING CODES; INTEGERS; PERFECT DELETION-CORRECTING CODES;

CODES (SYMBOLS);

EID: 33746626916     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.878237     Document Type: Article

References (26)

1. R. J. R. Abel, Five MOLS of Side 39 and 54 [Online]. Available: http:// www.emba.uvm.edu/~dinitz/newresults.part2.html
2. R. J. R. Abel, A. E. Brouwer, C. J. Colbourn, and J. H. Dinitz, "Mutually orthogonal Latin squares (MOLS)," in CRC Handbook of Combinatorial Designs, C. J. Colbourn and J. H. Dinitz, Eds., Boca Raton, FL, 1996, pp. 111-142, CRC.
3. R. J. R. Abel, "Some new BIBD's with block size 7," J. Combin. Des., vol. 8, pp. 146-150, 2000.
4. R. J. R. Abel and M. Greig, "Balance incomplete block designs with block size 7," Des., Codes Cryptogr., vol. 13, pp. 5-30, 1998.
5. A. M. Assaf, N. Shalaby, and J. Yin, "Directed packing and covering designs with block size four," Discr. Math., vol. 238, pp. 3-17, 2001.
6. R. D. Baker, "An elliptic semiplane," J. Combin. Theory A, vol. 25, pp. 193-195, 1978.
7. F. E. Bennett, N. Shalaby, and J. Yin, "Existence of directed GDD's with block size five," J. Combin. Des., vol. 6, pp. 389-402, 1998.
8. F. E. Bennett, R. Wei, J. Yin, and A. Mahmoodi, "Existence of DBIBD's with block size six," Utilitas Math., vol. 43, pp. 205-217, 1993.
9. T. Beth, D. Jungnickel, and H. Lenz, Design Theory. Cambridge, U.K.: Cambridge Univ. Press, 1999.
10. P. A. H. Bours, "On the construction of perfect deletion-correcting codes using design theory," Des., Codes and Cryptogr., vol. 6, pp. 5-20, 1995.
11. C. J. Colbourn and M. J. Colbourn, "Every twofold triple system triple system can be directed," J. Combin. Theory A, vol. 34, pp. 375-378, 1983.
12. M. Greig, "Recursive construction of balanced incomplete block designs with block size of 7, 8 or 9," Ars Combin., vol. 60, pp. 3-54, 2001.
13. H. Hanani, "Balance incomplete block designs and related designs," Discr. Math., vol. 11, pp. 255-369, 1975.
14. Y. Miao and L. Zhu, "On resolvable BIBD's with block size five," Ars Combin., vol. 39, pp. 261-275, 1995.
15. A. Klein, "On perfect deletion-correcting codes," J. Combin. Des., vol. 12, pp. 72-77, 2004.
16. V. I. Levenshtein, "On perfect codes in deletion and insertion metric," Discr. Math. Appl., vol. 2, pp. 241-258, 1992.
17. A. Mahmoodi, "Combinatorial and Algorithmic Aspects of Directed Designs," Ph.D. dissertation, University of Toronto, Toronto, ON, Canada, 1996.
18. A. Mahmoodi, "Existence of perfect 3-deletion-correcting codes," Des., Codes and Cryptogr., vol. 14, pp. 81-87, 1998.
19. D. K. Ray-Chaudhuri and R. M. Wilson, "The eixstence of resolvable block design," in A Survey of Combinatorial Theory, J. N. Srivastava, Ed., Amsterdam, The Netherlands, 1973, pp. 361-375, North-Holland.
20. N. Shalaby, J. Wang, and J. Yin, "Existence of perfect 4-deletion-correcting codes with length six," Des., Codes and Cryptogr., vol. 27, pp. 145-156, 2002.
21. N. Shalaby and J. Yin, "Directed packings with block size 5 and even v," Des., Codes and Cryptogr., vol. 6, pp. 133-142, 1995.
22. D.J. Street and J.R. Seberry, " All DBIBD's with block size four exist," Utilitas Math., vol. 18, pp. 27-34, 1980.
23. D. J. Street and W. H. Wilson, "On directed balanced incomplete block designs with block size five," Utilitas Math., vol. 18, pp. 161-174, 1980.
24. J. Wang and L. Ji, "Existence of T* (3, 4, v)-codes," J. Combin. Des., vol. 13, pp. 42-53, 2005.
25. R. M. Wilson, "Constructions and uses of pairwise balanced designs," Math. Centre Tracts, vol. 55, pp. 18-41, 1974.
26. J. Yin, " A combinatorial constraction for perfect deletion-correcting codes," Des., Codes Cryptogr., vol. 23, pp. 99-110, 2001.