Abstract
In this paper, codes over F5 with parameters [36, 18, 12], [48, 24, 15], [60, 30, 18], [64, 32, 18] and [76, 38, 21] which improve the previously known bounds on the minimum weight for linear codes over F5 are constructed from conference matrices. Through shortening and truncating, the above codes give numerous new codes over F5 which improve the previously known bounds on minimum weights.
Similar content being viewed by others
References
A. E. Brouwer, Bounds on the size of linear codes, In V.S. Pless and W.C. Huffman eds. Handbook of Coding Theory, Elsevier, Amsterdam (1998) pp. 295-461. Also available online at http:// www.win.tue.nl/math/dw/personalpages/aeb/voorlincod.html
P. J. Cameron and J. H. van Lint, Designs, Graphs, Codes and their Links, Cambridge University Press, Cambridge (1991).
A. V. Geramita and J. Seberry, Orthogonal Designs: Quadratic Forms and Hadamard Matrices, Marcel Dekker, New York (1979).
J. S. Leon, V. Pless and N. J. A. Sloane, Self-dual codes over GF(5), J. Combin. Theory Ser. A, Vol. 32 (1982) pp. 178-194.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Aaron Gulliver, T., Harada, M. On the Minimum Weight of Codes over F5 Constructed from Certain Conference Matrices. Designs, Codes and Cryptography 31, 139–145 (2004). https://doi.org/10.1023/B:DESI.0000012442.78414.e4
Issue Date:
DOI: https://doi.org/10.1023/B:DESI.0000012442.78414.e4