|
|||||
|
|
There exists no (15,5,4) RBIBD |
|
| Authors: | Petteri Kaski Patric R J stergrd |
| Institution: | Petteri Kaski,Patric R. J. Östergård |
| Abstract: | An (n, M, d)q code is a q‐ary code of length n, cardinality M, and minimum distance d. We show that there exists no (15,5,4) resolvable balanced incomplete block design (RBIBD) by showing that there exists no (equidistant) (14,15,10)3 code. This is accomplished by an exhaustive computer search using an orderly algorithm combined with a maximum clique algorithm. © 2001 John Wiley & Sons, Inc. J Combin Designs 9: 227–232, 2001 |
| Keywords: | equidistant code maximum clique orderly algorithm resolvable balanced incomplete block design |