New bounds are given for the minimal Hamming and Lee weights of self-dual codes over 9 . For a self-dual code of length n, the Hamming weight is bounded above by 4[n/24]#f (n mod 24), for an explicitly given function f; the Lee weight is bounded above by 8[n/24]#g(n mod 24), for a di!erent function
Self-dual codes over the integers modulo 4
✍ Scribed by J.H Conway; N.J.A Sloane
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 624 KB
- Volume
- 62
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The purpose of this paper is twofold. First, we generalize the results of Pless and Qian and those of Pless, Sole ´, and Qian for cyclic ޚ 4 -codes to cyclic ޚ p m -codes. Second, we establish connections between this new development and the results on cyclic ޚ p m -codes obtained by Calderban
Combinatorial designs have been used widely in the construction of self-dual codes. Recently a new method of constructing self-dual codes was established using orthogonal designs. This method has led to the construction of many new self-dual codes over small "nite "elds and rings. In this paper, we
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 .