Abstract
One of the most important problems of coding theory is to constructcodes with best possible minimum distances. In this paper, we generalize the method introduced by [8] and obtain new codes which improve the best known minimum distance bounds of some linear codes. We have found a new linear ternary code and 8 new linear codes over \(\mathbb{F}_5 \) with improved minimumdistances. First we introduce a generalized version of Gray map,then we give definition of quasi cyclic codes and introduce nearlyquasi cyclic codes. Next, we give the parameters of new codeswith their generator matrices. Finally, we have included twotables which give Hamming weight enumerators of these new codes.
Similar content being viewed by others
References
A. E. Brouwer, Linear code bound (server), Eindhoven University of Technology, The Netherlands, http://www.win.tue.nl/win/math/dw/ voorlincod.html.
A. E. Brouwer and T. Verhoeff, An updated table of minimum distance bounds for binary linear codes, IEEE Trans. Inform. Theory, Vol. 39 (1993) pp. 662–677.
A. R. Hammons, Jr. P. V. Kumar, A. R. Calderbank, N. J. A. Sloane and P. Sole, The Z 4-linearity of Kerdock, Preparata, Goethals and related Codes, IEEE Trans. Inform. Theory, Vol. 40 (1994) pp. 301–319.
Christine Bachoc, Applications of Coding Theory to the Construction of Modular Lattices, Journal of Combinatorial Theory, Series A 78 (1997) pp. 92–119.
F. J. MacWilliams and N. J. A Sloane, The Theory Of Error Correcting Codes (1996).
Jean Conan and Gerald Seguin, Structural Properties and Enumeration of Quasi Cyclic Codes, AAECC, Vol. 4 (1993) pp. 25–39.
K. Thomas, Polynomial Approach to Quasy-Cyclic Codes, Bul. Cal. Math. Soc., Vol. 69 (1977) pp. 51–59.
T. Aaron Gulliver, Masaaki Harada, Codes over F3+uF3 and Improvements to the Bounds on Ternary Linear Codes, Des., Codes & Crypt., submitted in May 1998.
T. Kasami, A Gilbert-Varshamov bound for quasi-cyclic codes of rate 1/2, IEEE Trans. Inform. Theory, Vol. 20 (1974) pp. 679.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Siap, I., Ray-Chaudhuri, D.K. New Linear Codes Over \(\mathbb{F}_3 \) and \(\mathbb{F}_5 \)and Improvements on Bounds. Designs, Codes and Cryptography 21, 223–233 (2000). https://doi.org/10.1023/A:1008356131869
Issue Date:
DOI: https://doi.org/10.1023/A:1008356131869