Abstract
Thirty-one new linear codes over GF(9) are constructed, and the nonexistence of thirty codes is proved.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Hill, R., Optimal Linear Codes, Cryptography and Coding II, Mitchel, C., Ed., Oxford: Oxford Univ. Press, 1992, pp. 75-104.
Bierbrauer, J. and Gulliver, T.A., New Linear Codes over GF(9), Australas. J. Comb., 2000, vol. 21, pp. 131-140.
Daskalov, R.N. and Gulliver, T.A., New 6-Dimensional Linear Codes over GF(8) and GF(9), to appear in J. Comb. Math. Comb. Comput., 2004, vol. 48.
Daskalov, R.N. and Kapralov, S.N., New Systematic Quasi-cyclic Codes over GF(9) in Dimensions 7 and 8, in Mathematics and Education in Mathematics, Sofia, 2001, pp. 118-123.
Daskalov, R. and Hristov, P., New One-Generator Quasi-cyclic Codes over GF(7), Probl. Peredachi Inf., 2002, vol. 38,no. 1, pp. 59-63 [Probl. Inf. Trans. (Engl. Transl.), 2002, vol. 38, no. 1, pp. 50-54].
MacWilliams, F.J. and Sloane, N.J.A., The Theory of Error-Correcting Codes, Amsterdam: North-Holland, 1977. Translated under the title Teoriya kodov, ispravlyayushchikh oshibki, Moscow: Svyaz', 1979.
Hill, R. and Newton, D.E., Optimal Ternary Linear Codes, Designs Codes Crypt., 1992, vol. 2, pp. 137-157.
Koshy, T., Polynomial Approach to Quasi-cyclic Codes, Bull. Calcutta Math. Soc., 1977, vol. 69, pp. 51-59.
Greenough, P.P. and Hill, R., Optimal Ternary Quasi-cyclic Codes, Designs Codes Crypt., 1992, vol. 2, pp. 81-91.
Séguin, G.E. and Drolet, G., The Theory of 1-Generator Quasi-cyclic Codes, Tech. Report of Royal Military College of Canada, Kingston, 1991.
Lally, K. and Fitzpatrick, P., Construction and Classification of Quasi-cyclic Codes, Proc. Int. Workshop on Coding and Cryptography (WCC'99), Paris, 1999, pp. 11-20.
Siap, I., Aydin, N., and Ray-Chaudhuri, D., New Ternary Quasi-cyclic Codes with Better Minimum Distances, IEEE Trans. Inf. Theory, 2000, vol. 46,no. 4, pp. 1554-1558.
Kasami, T., A Gilbert-Varshamov Bound for Quasi-cyclic Codes of Rate 1/2, IEEE Trans. Inf. Theory, 1974, vol. 20,no. 5, p. 679.
Brouwer, A.E., Linear Code Bounds [electronic table]. Available online at www.win.tue.nl/~aeb/voorlincod.html.
Solomon, G. and van Tilborg, H.C.A., A Connection Between Block and Convolutional Codes, SIAM J. Appl. Math., 1979, vol. 37,no. 2, pp. 358-369.
Esmaeili, M., Gulliver, T.A., Secord N.P., and Mahmoud, S.A., A Link between Quasi-cyclic Codes and Convolutional Codes, IEEE Trans. Inf. Theory, 1998, vol. 44,no. 1, pp. 431-435.
Hall, M., Jr., Combinatorial Theory, Waltham: Blaisdell, 1967. Translated under the title Kombinatorika, Moscow: Mir, 1970.
Chen, Z., Six New Binary Quasi-cyclic Codes, IEEE Trans. Inf. Theory, 1994, vol. 40,no. 5, pp. 1666-1667.
Bogdanova, G. and Kapralov, S.N., On the Construction of q-ary Gray Codes and Their Applications, in Proc. 7th Int. Workshop on Algebraic and Combinatorial Coding Theory, June 2000, Bansko, Bulgaria, pp. 78-83.
Kapralov, S.N., Hristov, P., and Bogdanova, G.T., The New Version of QLC—A Computer Program for Linear Codes Studying, in Proc. Int. Workshop on Optimal Codes and Related Topics, Sozopol, Bulgaria, 1995, pp. 11-14.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Daskalov, R., Metodieva, E. & Hristov, P. New Minimum Distance Bounds for Linear Codes over GF(9). Problems of Information Transmission 40, 13–24 (2004). https://doi.org/10.1023/B:PRIT.0000024876.30498.f4
Issue Date:
DOI: https://doi.org/10.1023/B:PRIT.0000024876.30498.f4