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
โฆ LIBER โฆ
Combinatorial properties of extremal doubly-even codes of length 48
โ Scribed by B. B. Venkov; D. M. Ivanov
- Publisher
- Springer US
- Year
- 1991
- Tongue
- English
- Weight
- 334 KB
- Volume
- 57
- Category
- Article
- ISSN
- 1573-8795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Extremal doubly-even codes of length 64
โ
S.N. Kapralov; V.D. Tonchev
๐
Article
๐
1990
๐
Elsevier Science
๐
English
โ 331 KB
Nonexistence of extremal doubly even sel
โ
Xinrong Ma
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 316 KB
Extremal doubly-even codes of length 40
โ
F.C. Bussemaker; V.D. Tonchev
๐
Article
๐
1990
๐
Elsevier Science
๐
English
โ 281 KB
New extremal doubly-even codes of length
โ
F.C. Bussemaker; V.D. Tonchev
๐
Article
๐
1989
๐
Elsevier Science
๐
English
โ 404 KB
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