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
MDS Self-Dual Codes over Large Prime Fields
โ Scribed by S Georgiou; C Koukouvinos
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 140 KB
- Volume
- 8
- Category
- Article
- ISSN
- 1071-5797
No coin nor oath required. For personal study only.
โฆ Synopsis
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 generalize this method by using generalized orthogonal designs, and we give another new method that creates and solves Diophantine equations over GF(p) in order to "nd suitable generator matrices for self-dual codes. We show that under the necessary conditions these methods can be applied as well to small and large "elds. We apply these two methods to study self-dual codes over GF(31) and GF(37). Using these methods we obtain some new maximum distance separable self-dual codes of small orders.
2002 Elsevier Science (USA)
๐ SIMILAR VOLUMES
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 .
## B as a modular constituent with non-zero multiplicity. This result suggests that we should investigate the decomposition modulo 2 of the irreducible characters in 1 G when G is a group of Lie type of odd characteristic and B see which real-valued irreducible Brauer characters occur as constitue