Existence of directed BIBDs with block size 7 and related perfect 5-deletion-correcting codes of length 7
- 63 Downloads
Wang and Yin have established the existence of a directed BIBD with block size 7 and index 1 (a DBIBD(v, 7, 1)) for all v ≡ 1, 7 (mod 21) except for v = 22 and possibly for 68 other cases. In this paper, we reduce the number of possible exceptions to 4, namely v = 274, 358, 400, 526. Correspondingly, for all such v, our results establish the existence of a T(2, 7, v)-code or equivalently a perfect 5-deletion-correcting code with words of length 7 over an alphabet of size v, where all the coordinates must be different. In the process, we also reduce the possible exceptions for (v, 7, 2)-BIBDs to 2 cases, v = 274 and 358 (in addition to the non-existent (22, 7, 2)-BIBD).
KeywordsBIBD Directed BIBD (DBIBD) Directed GDD (DGDD)
Mathematics Subject Classification (2000)Primary 05B05
Unable to display preview. Download preview PDF.
- 2.Abel R.J.R., Colbourn C.J., Dinitz J.H.: Mutually orthogonal latin squares (MOLS). In: Colbourn, C.J., Dinitz, J.H. (eds) The CRC Handbook of Combinatorial Designs, 2nd edn, pp. 160–193. CRC Press, Boca Raton, FL (2006)Google Scholar
- 8.Colbourn C.J., Rosa A.: Directed and Mendelsohn triple systems. In: Dinitz, J.H., Stinson, D.R. (eds) Combinatorial Design Theory: A Collection of Surveys, pp. 97–136. Wiley, New York (1992)Google Scholar
- 10.Mahmoodi A.: Combinatorial and algorithmic aspects of directed designs. PhD Thesis, University of Toronto (1996).Google Scholar
- 18.Wilson R.M.: Constructions and uses of pairwise balanced designs. Math. Centre Tracts. 55, 18–41 (1974)Google Scholar