๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Self-orthogonal designs and extremal doubly even codes

โœ Scribed by Vladimir D Tonchev

Book ID
107885098
Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
455 KB
Volume
52
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On self-dual doubly-even extremal codes
On self-dual doubly-even extremal codes
โœ Helmut Koch ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 488 KB

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

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