In this paper, we consider the problem of the existence of a basis of orthogonal vectors of norm 2k in the Leech lattice. Recently it has been shown that there is such a basis for every k ( 2) which is not of the form 11 r . In this paper, this problem is completely settled by finding such a basis f
Orthogonal designs, self-dual codes, and the Leech lattice
โ Scribed by Masaaki Harada; Hadi Kharaghani
- Publisher
- John Wiley and Sons
- Year
- 2005
- Tongue
- English
- Weight
- 212 KB
- Volume
- 13
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
โฆ Synopsis
Abstract
Symmetric designs and Hadamard matrices are used to construct binary and ternary selfโdual codes. Orthogonal designs are shown to be useful in construction of selfโdual codes over large fields. In this paper, we first introduce a new array of order 12, which is suitable for any set of four amicable circulant matrices. We apply some orthogonal designs of order 12 to construct new selfโdual codes over large finite fields, which lead us to the odd Leech lattice by Construction A. ยฉ 2005 Wiley Periodicals, Inc. J Combin Designs 13: 184โ194, 2005.
๐ SIMILAR VOLUMES
In this paper, we construct many new extremal Type II Z 6 -codes of length 24, and consequently we show that there is at least one extremal Type II Z 6 -code C of length 24 such that the binary and ternary reductions of C are B and T , respectively, for every binary Type II code B and every extremal
In this note, we give Z 4 -code constructions of the Niemeier lattices, showing their embedding in the Leech lattice. These yield an alternative proof of a recent result by Dong et al. [5].
In this note, the existence of self-dual codes and formally self-dual even codes is investigated. A construction for self-dual codes is presented, based on extending generator matrices. Using this method, a singly-even self-dual [70, 35, code is constructed from a self-dual code of length 68. This i
## Abstract An Erratum has been published for this article in Journal of Combinatorial Designs 14: 83โ83, 2006. We enumerate a list of 594 inequivalent binary (33,16) doublyโeven selfโorthogonal codes that have no allโzero coordinates along with their automorphism groups. It is proven that if a (2
## Abstract We provide a classification method of weighing matrices based on a classification of selfโorthogonal codes. Using this method, we classify weighing matrices of orders up to 15 and order 17, by revising some known classification. In addition, we give a revised classification of weighing