𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Self-dual codes and the (22,8,4) balanced incomplete block design

✍ Scribed by R. T. Bilous; G. H. J. van Rees


Publisher
John Wiley and Sons
Year
2005
Tongue
English
Weight
142 KB
Volume
13
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

An Erratum has been published for this article in Journal of Combinatorial Designs 14: 83–83, 2006.

We enumerate a list of 594 inequivalent binary (33,16) doubly‐even self‐orthogonal codes that have no all‐zero coordinates along with their automorphism groups. It is proven that if a (22,8,4) Balanced Incomplete Block Design were to exist then the 22 rows of its incident matrix will be contained in at least one of the 594 codes. Without using computers, we eliminate this possibility for 116 of these codes. Β© 2005 Wiley Periodicals, Inc. J Combin Designs.


πŸ“œ SIMILAR VOLUMES


Erratum to: Self-dual codes and the (22,
✍ R. T. Bilous; G. H. J. van Rees πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 35 KB

## Abstract The original article to which this Erratum refers was published in Journal of Combinatorial Designs 13: 363–376, 2005. No Abstract.

Virtually balanced incomplete block desi
✍ A. S. Hedayat; J. Stufken; W. G. Zhang πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 349 KB

When basic necessary conditions for the existence of a balanced incomplete block design are satisfied, the design may still not exist or it may not be known whether it exists. In either case, other designs may be considered for the same parameters. In this article we introduce a class of alternative

Further results on the maximum size of a
✍ I. Adamczak; D. L. Kreher; A. C. H. Ling; R. S. Rees πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 192 KB πŸ‘ 1 views

## Abstract Kreher and Rees 3 proved that if __h__ is the size of a hole in an incomplete balanced design of order Ο… and index Ξ» having minimum block size $k \ge t+1$, then, They showed that when __t__ = 2 or 3, this bound is sharp infinitely often in that for each __h__ β‰₯ __t__ and each __k__ β‰₯ _