## 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 ac
There exists no (15,5,4) RBIBD
✍ Scribed by Petteri Kaski; Patric R. J. Östergård
- Book ID
- 102307454
- Publisher
- John Wiley and Sons
- Year
- 2001
- Tongue
- English
- Weight
- 94 KB
- Volume
- 9
- Category
- Article
- ISSN
- 1063-8539
- DOI
- 10.1002/jcd.1009
No coin nor oath required. For personal study only.
✦ Synopsis
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
📜 SIMILAR VOLUMES
be your guide among infinities. Astonished, struck with awe, and yet with mind at ease Envisage lines that can be evermore extended, And numbers whose majestic range is never ended. Among the latter are aristocrats, the primes, Which multiplying lesser numbers many times Cannot engender. Thereof, t