On various parameters of \(\mathbb{Z}_q\)-simplex codes for an even integer \(q\)

P. Chella Pandian, C. Durairajan

Abstract


In this paper, we defined the \(\mathbb{Z}_q\)-linear codes and discussed its various parameters. We constructed \(\mathbb{Z}_q\)-Simplex code and
\(\mathbb{Z}_q\)-MacDonald code and found its parameters. We have given a lower and  an upper bounds of its covering radius for q is an even integer.

Keywords


codes over finite rings, \(\mathbb{Z}_q\)-linear code, \(\mathbb{Z}_q\)-simplex code,

Full Text:

PDF

References


bibitem{aghos99}

Aoki T., Gaborit P., Harada M., Ozeki M. and Sol{'e} P.

{it On the covering radius of $mathbb Z_{4}$ codes and their lattices, } vol. 45,

{ IEEE Trans. Inform. Theory} no. 6,1999, pp. 2162--2168.

bibitem{bgl99} Bhandari M. C., Gupta M. K. and Lal A. K.

{it On $mathbb Z_4$ Simplex codes and their gray images, }

{Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-13,

Lecture Notes in Computer Science, }

{1719}, 1999, pp. 170--180.

bibitem{bsbm97} Bonnecaze A., Sol'e P., Bachoc C. and Mourrain B.

{it Type II codes over $mathbb Z_4$, }

{ IEEE Trans. Inform. Theory, }

{43}, 1997, pp. 969--976.

bibitem{bu99} Bonnecaze A. and Udaya P.

{it Cyclic Codes and Self-Dual Codes over ${F}_2 + u F_2$, }

{ IEEE Trans. Inform. Theory, }

{ 45(4)}, 1999, pp. 1250--1254.

bibitem{survey}

Cohen G.~D. Karpovsky M. G., Mattson H. F. and Schatz J. R.

{it Covering radius-Survey and recent results, }vol. 31 {IEEE Trans. Inform. Theory, }no. 3, 1985, mbox{pp.~328--343}.

bibitem{further}

Cohen C., Lobstein A. and Sloane N. J. A. {it Further Results on the Covering Radius of

Codes, } vol. 32,

{ IEEE Trans. Inform. Theory}, no. 5, 1986, pp. 680--694.

bibitem{cg03}

Colbourn C. J. and Gupta M. K. {it On quaternary MacDonald codes, }

Proc. Information Technology : Coding and Computing (ITCC), April, 2003, pp. 212--215.

bibitem{cs93}

Conway J. H. and Sloane N. J. A.

{it Self-dual codes over the integers modulo $4$, }

{ Journal of Combinatorial Theory Series~A, }

{62}, 1993, pp. 30--45.

bibitem{dgh99}

Dougherty S. T., Gulliver T. A. and Harada M. {it Type II codes over finite rings and even

unimodular lattices, }

{J. Alg. Combin., 9, 1999, pp. 233--250}.

bibitem{dghsr99}

Dougherty S. T., Gaborit P., Harda M. and Sole P. {it Type II codes over $mathbb F_{2}+umathbb

F_{2}$, }

{IEEE Trans. Inform. Theory, 45, 1999, pp. 32--45.}

bibitem{dhs99}

Dougherty S. T., Harada M. and Sol'e P.

{it Self-dual codes over rings and the Chinese Remainder Theorem, }

{ Hokkaido Math. J., 28, 1999, pp. 253--283.}

bibitem{duraithesis96}Durairajan C. {it On Covering Codes and Covering Radius of Some

Optimal Codes, }{ PhD Thesis, Department of Mathematics, IIT, Kanpur}, 1996.

bibitem{el03}

El-Atrash M. and Al-Ashker M.

{ Linear Codes over ${F}_2 + u {F}_2,$}

{ Journal of The Islamic University of Gaza,}

{ 11(2)}, 2003, 53-68.

bibitem{gupta}

Gupta M. K. and Durairajan C. { On the Covering Radius of some Modular Codes,}

{ Communicated.}

bibitem{hkcss94}

Hammons A. R., Kumar P. V., Calderbank A. R., Sloane N. J. A. and Sol{'e} P.

{ The $;mathbb Z_4$-linearity of kerdock, preparata, goethals, and related codes,}

{IEEE Trans. Inform. Theory},

{40}, 1994, 301--319.

bibitem{mac} MacWilliam F. J and Sloane N. J. A.

{it Theory of Error-Correcting codes,} The Netherlands :

{ Amsterdom, North-Holland, 1977.}

bibitem{mat}

Mattson H. F. Jr. { An Improved upper bound on covering radius.} Lecture Notes in Computer

Science, vol. 228, Springer, 1986, pp. 90--106.

bibitem{vsr96}

Vazirani V. V., Saran H. and SundarRajan B.

An efficient algorithm for constructing minimal trellises for codes

over finite abelian groups.

{ IEEE Trans. Inform. Theory}, vol. 42, no. 6, 1996, pp. 1839--1854.


Refbacks

  • There are currently no refbacks.