Any symmetric 2-(31, 10,3) design gives rise to a binary self-dual doubly-even code of length 64, and the code is extremal if and only if the design does not possess any ovals [15]. Codes derived from the known symmetric 2-(31,10,3) designs without ovals and their automorphism groups are investigate
Extremal self-dual codes from symmetric designs
β Scribed by Edward Spence; Vladimir D. Tonchev
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 227 KB
- Volume
- 110
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Let C be a binary linear self-dual doubly-even code of length n and minimal weight d. Such codes exist only if 12 = 0 (mod 8). We put II = 24r + 8s, s = 0, 1, 2. It follows from the work of Gleason [2] and of Mallows and Sloane [6] that d s 4r + 4. C is called extremal if d = 4r + 4. In the followin
## Abstract Symmetric designs and Hadamard matrices are used to construct binary and ternary selfβdual codes. Orthogonal designs are shown to be useful in construction of selfβdual codes over large fields. In this paper, we first introduce a new array of order 12, which is suitable for any set of f
## 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 (2
## Abstract There are exactly 60 inequivalent Hadamard matrices of order 24. In this note, we give a classification of the selfβdual π½~5~βcodes of length 48 constructed from the Hadamard matrices of order 24. Β© 2004 Wiley Periodicals, Inc.
## Abstract The original article to which this Erratum refers was published in Journal of Combinatorial Designs 13: 363β376, 2005. No Abstract.