In this article, we investigate the Hamming weight enumerators of self-dual codes over % O and 9 I . Using invariant theory, we determine a basis for the space of invariants to which the Hamming weight enumerators belong for self-dual codes over % O and 9 I .
A restriction on the weight enumerator of a self-dual code
โ Scribed by Harold N Ward
- Publisher
- Elsevier Science
- Year
- 1976
- Tongue
- English
- Weight
- 186 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The number of words of weight w in the product code of linear codes with minimum distances d, and d, is expressed in the number of low weight words of the constituent codes, provided that w <d,d, + max(d,, d<). By examples it is shown that, in general, the full weight enumerator of a product code is
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
We give a construction of an infinite class of doubly even self dual binary codes including a code of length 112. (The study of such a code is closely related to the existence problem of a projective plane of order ten.)