New Optimal Self-Dual Codes over GF(7)
โ Scribed by T. Aaron Gulliver; Masaaki Harada
- Publisher
- Springer Japan
- Year
- 1999
- Tongue
- English
- Weight
- 113 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A central problem in coding theory is that of finding the smallest length for which there exists a linear code of dimension k and minimum distance d, over a field of ~7 elements, We consider here the problem for quaternary codes (q=4), solving the problem for k< 3 for all values of d, and for k=4 fo
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