✦ LIBER ✦

Extremal doubly-even codes of length 40 derived from Hadamard matrices of order 20

✍ Scribed by F.C. Bussemaker; V.D. Tonchev

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 281 KB
Volume: 82
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90208-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New extremal doubly-even codes of length

New extremal doubly-even codes of length 56 derived from Hadamard matrices of order 28

✍ 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

Extremal doubly-even codes of length 64

Extremal doubly-even codes of length 64 derived from symmetric designs

✍ S.N. Kapralov; V.D. Tonchev 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 331 KB

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