×

Lexicodes over rings. (English) Zbl 1321.94143

Summary: In this paper, we consider the construction of linear lexicodes over finite chain rings by using a \(B\)-ordering over these rings and a selection criterion. As examples we give lexicodes over \(\mathbb Z_4\) and \(\mathbb F_2+u\mathbb F F_2\). It is shown that this construction produces many optimal codes over rings and also good binary codes. Some of these codes meet the Gilbert bound. We also obtain optimal self-dual codes, in particular the octacode.

MSC:

94B65 Bounds on codes
94B05 Linear codes (general theory)
16T99 Hopf algebras, quantum groups and related topics

References:

[1] Aoki T., Gaborit P., Harada M., Ozeki M., Solé P.: On the covering radius of \[\mathbb{Z}_4\]-codes and their lattices. IEEE Trans. Inf. Theory 45(6), 2162-2168 (1999). · Zbl 0959.94036
[2] Aydin N., Asamov T.: Database for codes over \[\mathbb{Z}_4\]. Available online at: http://www.asamov.com/Z4Codes/CODES/ShowCODESTablePage.aspx. · Zbl 1269.94033
[3] Bonn J.T.: Forcing linearity on greedy codes. Des. Codes Cryptogr. 9(1), 39-49 (1996). · Zbl 0864.94032
[4] Brualdi R.A., Pless V.: Greedy codes. J. Comb. Theory Ser. A 64, 10-30 (1993). · Zbl 0778.94006
[5] Conway J.H., Sloane N.J.A.: Lexicographic codes: error-correcting codes from game theory. IEEE Trans. Inf. Theory 32(3), 337-348 (1986). · Zbl 0594.94023
[6] Dougherty S.T., Gaborit P., Harada M., Solé P.: Type II codes over \[\mathbb{F}_2+u\mathbb{F}_2\]. IEEE Trans. Inf. Theory, 45(1), 32-45 (1999). · Zbl 0947.94023
[7] Dougherty S.T., Gulliver A., Park Y.H.: Optimal linear codes over \[\mathbb{Z}_m\]. J. Korean Math. Soc. 44(5), 1139-1162 (2007). · Zbl 1136.94008
[8] Grassl M.: Bounds on the minimum distance of linear codes and quantum codes. Available online at: http://www.codetables.de. · Zbl 1145.94300
[9] Greferath M., Schmidt S.E.: Gray isometries for finite chain rings and non-linear ternary \[(36,3^{12},15)\]. IEEE. Trans. Inf. Theory 45(7), 2522-2524 (1999). · Zbl 0960.94035
[10] Guenda K.: Gulliver T.A.: MDS and self-dual codes over rings. Finite Fields Appl. 18(6), 1061-1075 (2012). · Zbl 1261.94035
[11] Hammons A.R. Jr., Kumar P.V., Calderbank A.R., Sloane N.J.A., Solé P.: The \[\mathbb{Z}_4\]-linearity of Kerdock, Preparata, Goethals, and related codes. IEEE Trans. Inf. Theory 40(2), 301-319 (1994). · Zbl 0811.94039
[12] Honold T., Nechaev A.A.: Weighted modules and representations of codes. Tech. Univ. München, Fak. Math. Report, Beitrage Zur Geometrie and Algebra 36 (1998). · Zbl 0951.94013
[13] Huffman W.C., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, New York (2003). · Zbl 1099.94030
[14] Levenstein T.: A class of systematic codes. Soviet Math. Dokl. 1, 368-371 (1960) · Zbl 0095.11503
[15] van Zanten A.J.: Lexicographic order and linearity. Des. Codes Cryptogr. 10(1), 85-97 (1997). · Zbl 0868.94054
[16] van Zanten A.J., Nengah Suparta I.: On the construction of linear \[q\]-ary lexicodes. Des. Codes Cryptogr. 37(1), 15-29 (2005). · Zbl 1158.94408
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.