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
Nonexistence of extremal doubly even self-dual codes with large length
โ Scribed by Xinrong Ma
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 316 KB
- Volume
- 185
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
We give a construction of an infinite class of doubly even self dual binary codes including a code of length 112. (The study of such a code is closely related to the existence problem of a projective plane of order ten.)
by J.H. van Lint Four new doubly-even (56, 28, 12) codes are constructed from Hadamard matrices of order 28. We assume that the reader is familiar with the basic facts from the theory of self-dual codes and designs. Our terminology and notation follow [3, lo]. The following theorem provides a meth