Self-orthogonal designs and extremal doubly even codes

V.D. Tonchev

doi:10.1016/0097-3165(89)90030-7

Self-orthogonal designs and extremal doubly even codes

V.D. Tonchev

Research output: Contribution to journal › Article › Academic › peer-review

36 Citations (Scopus)

Abstract

A general method unifying the known constructions of binary self-orthogonal codes from designs is described. As an application more than 70 inequivalent extremal doubly even self-dual codes of length 40 are constructed from Hadamard matrices of order 20. Some of these codes do not admit nontrivial automorphisms of odd orders, and there is a code with trivial automorphism group.

Original language	English
Pages (from-to)	197-205
Number of pages	9
Journal	Journal of Combinatorial Theory, Series A
Volume	52
Issue number	2
DOIs	https://doi.org/10.1016/0097-3165(89)90030-7
Publication status	Published - 1989

Access to Document

10.1016/0097-3165(89)90030-7

Cite this

@article{4f42494cba3b4dee8977d861ba7b930d,

title = "Self-orthogonal designs and extremal doubly even codes",

abstract = "A general method unifying the known constructions of binary self-orthogonal codes from designs is described. As an application more than 70 inequivalent extremal doubly even self-dual codes of length 40 are constructed from Hadamard matrices of order 20. Some of these codes do not admit nontrivial automorphisms of odd orders, and there is a code with trivial automorphism group.",

author = "V.D. Tonchev",

year = "1989",

doi = "10.1016/0097-3165(89)90030-7",

language = "English",

volume = "52",

pages = "197--205",

journal = "Journal of Combinatorial Theory, Series A",

issn = "0097-3165",

publisher = "Academic Press Inc.",

number = "2",

}

TY - JOUR

T1 - Self-orthogonal designs and extremal doubly even codes

AU - Tonchev, V.D.

PY - 1989

Y1 - 1989

N2 - A general method unifying the known constructions of binary self-orthogonal codes from designs is described. As an application more than 70 inequivalent extremal doubly even self-dual codes of length 40 are constructed from Hadamard matrices of order 20. Some of these codes do not admit nontrivial automorphisms of odd orders, and there is a code with trivial automorphism group.

AB - A general method unifying the known constructions of binary self-orthogonal codes from designs is described. As an application more than 70 inequivalent extremal doubly even self-dual codes of length 40 are constructed from Hadamard matrices of order 20. Some of these codes do not admit nontrivial automorphisms of odd orders, and there is a code with trivial automorphism group.

U2 - 10.1016/0097-3165(89)90030-7

DO - 10.1016/0097-3165(89)90030-7

M3 - Article

SN - 0097-3165

VL - 52

SP - 197

EP - 205

JO - Journal of Combinatorial Theory, Series A

JF - Journal of Combinatorial Theory, Series A

IS - 2

ER -

Self-orthogonal designs and extremal doubly even codes

Abstract

Access to Document

Fingerprint

Cite this