×

Computation of minimum Hamming weight for linear codes. (English) Zbl 1455.94224

Summary: In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free \(R\)-submodules of a finite quasi-Frobenius ring \(R\) which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Gröbner basis and we show that under certain conditions a linear code takes the maximum of minimum Hamming weight.

MSC:

94B05 Linear codes (general theory)
94B65 Bounds on codes
13P10 Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
11T71 Algebraic coding theory; cryptography (number-theoretic aspects)

References:

[1] W. Adams, P. Loustaunau,An Introduction to Gr¨obner basis, Graduate Studies in Math. 3, Amer. Math. Soc, Providence, 1994. · Zbl 0803.13015
[2] D. D. Anderson, M. Bataineh, Generalization of Prime Ideals,Comm. in Algebra,36, (2008), 686-696. · Zbl 1140.13005
[3] I. Constantinescu, W. Heise, T. Honold, Monomial Extensions of Isometries between Codes overZm,Proceedings of the 5th International Workshop on Algebraic and Combinatorial Coding Theory (ACCT ’96), Unicorn Shumen, (1998), 98-104. · Zbl 0923.94029
[4] D. Cox, J. Little, D. O’Shea,Ideals, Varieties, and Algorithms, Springer, New York, 1992. · Zbl 0756.13017
[5] M. Greferath, S. Schmidt, Finite-ring Combinatorics and MacWilliams’ Equivalence Theorem,J. of Combin. Theory, Ser. A.,92, (2000), 17-28. · Zbl 1087.94022
[6] J. A. Hammons, P. Kumar, A. Calderbank, N. Sloane,P. Sol´, TheZ4linearity of Kerdock, Preparata, Goethals and Related Codes,IEEE Trans. Inform. Theory,40, (1994), 301-319. · Zbl 0811.94039
[7] T. Honold, I. Landjev, Linear Codes over Finite Chain Rings,Electronic J. of Combinatorics, (2000), 7-11. · Zbl 1025.94017
[8] T. Honold, I. Landjev, Projective Hjelmslev geometries,Proceedings of the Second International Workshop on Optimal Codes, (1998), 97-115. · Zbl 1196.94092
[9] T. Honold, I. Landjev, Arcs in Projective Hjelmslev planes,Discrete Math. Appl.,11, (2001), 53-70. · Zbl 1054.51005
[10] H. Horimoto, K. Shiromoto, A Singleton Bound for Linear Codes over quasi-Frobenius Rings,Proceedings of the 13th AAECC Symposium On Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes, Hawaii, (1999), 51-52.
[11] H. Horimoto, K. Shiromoto, MDS Codes over Finite quasi-Frobenius Rings, preprint. · Zbl 0991.94529
[12] M. Kreuzer, L. Robbiano,Computational Commutative Algebra 1 and 2, Springer-Verlag, 2000. · Zbl 0956.13008
[13] A. S. Kuzmin, V. L. Kurakin, V. T. Markov, A. V. Mikhalev, A. A. Nechaev,Linear codes and Polylinear Recurrences over Finite Rings and Modules (Survey), Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. Proc. of the 13-th. Int Symp. AAECC
[14] LNCS, Springer, 1999.
[15] T. Y. Lam,Lectures on Modules and Rings, Graduate Texts in Mathematics, Vol. 189, Springer, New York, 1998.
[16] F. MacWilliams, N. Sloane,The Theory of Error-Correcting Codes, Amsterdam, The Netherlands: North-Holland, 1997. · Zbl 0369.94008
[17] G. Nebe, E. Rains, N. Sloane,Self-Dual Codes and Invariant Theory, Springer, Berlin, 2006. · Zbl 1173.94447
[18] A. A. Nechaev, Linear Codes and Polylinear Recurrences over Finite Rings and quasiFrobenius modules,Dokl. Akad. Nauk.(in Russian),345(1), (1995), 229-254. · Zbl 0882.16012
[19] A. A. Nechaev, Linear Codes over Modules and over Spaces, MacWilliams Identity, Proceedings of the 1996 IEEE Int. Symp. Inf. Theory and Appl., Victoria B. C., Canada, (1996), 35-38.
[20] A. A. Nechaev, The Kerdock Code in a Cyclic Form,Discrete Math. Appl.,1, (1991), 365-384. · Zbl 0734.94023
[21] A. A. Nechaev, A. S. Kuzmin, V. T. Markov, Linear Codes over Finite Rings and Modules,Fundamentalnaja prikladnaja matematika(in Russian),2(3), (1996), 195-254. · Zbl 1053.94566
[22] R. Nekooei, E. Rostami, On SPAP-rings,Bull. Iranian Math. Soc.,41, (2015), 907-921. · Zbl 1373.13025
[23] G. Norton , A.S˘al˘agean, On the Hamming Distance of Linear Codes over a Finite Chain Ring.IEEE Trans. Inform. Theory,46, (2000), 1060-1067. · Zbl 0963.94043
[24] E. Rostami, A Graphical Characterization for SPAP-Rings,Iran. J. Math. Sci. Inform., 13(1), (2018), 67-73. · Zbl 1455.13008
[25] K. Shiromoto, L. Storme, A Griesmer Bound for Linear Codes over Finite quasi-Frobenius Rings,Discrete Applied Mathematics,128, (2003), 263-274. · Zbl 1026.94025
[26] A. Tehranian, H. R. Maimani, A study of the Total graph,Iran. J. Math. Sci. Inform., 6(2), (2011), 75-80. · Zbl 1257.05140
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.