Abstract
A generalized definition of higher weights for codes over finite chain rings and principal ideal rings and bounds on the minimum higher weights in this setting are given. Using this we generalize the definition for higher MDS and MDR codes. Computationally, the higher weight enumerator of lifted Hamming and Simplex codes over \({\mathbb{Z}_4}\), the minimum higher weights for the lifted code of the binary [8,4,4] self-dual extended Hamming code, the lifted code of the ternary [12,6,6] self-dual Golay code and the lifted code of the binary [24,12,8] self-dual Golay code are given. Joint weight enumerators are used to produce MacWilliams relations for specific higher weight enumerators.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Calderbank A.R., Sloane N.J.A.: Modular and p-adic cyclic codes. Des. Codes Cryptogr. 6, 21–35 (1995)
Cannon J., Playoust C.: An Introduction to Magma. University of Sydney, Sydney (1994)
Dougherty S.T., Gupta M., Shiromoto K.: On generalized weights for codes over \({\mathbb{Z}_k}\). Aust. J. Combinat. 31, 231–248 (2005)
Dougherty, S.T., Han, S.: Higher weights and generalized MDS codes. J. Korean Math. Soc. (to appear)
Dougherty S.T., Harada M., Oura M.: Note on the g-fold joint weight enumerators of self-dual codes over \({\mathbb{Z}_k}\). AAECC 11, 437–445 (2001)
Dougherty S.T., Kim J.-L., Kulosman H.: MDS codes over finite principal ideal rings. Des. Codes Cryptogr. 50, 77–92 (2008)
Dougherty S.T., Kim S.Y., Park Y.H.: Lifted codes and their weight enumerators. Discr. Math. 305, 123–135 (2005)
Dougherty S.T., Liu H.: Independence of vectors in codes over rings. Des. Codes Cryptogr. 51, 55–68 (2009)
Dougherty S.T., Shiromoto K.: MDR codes over \({\mathbb{Z}_k}\). IEEE Trans. Inform. Theory 46, 265–269 (2000)
Horimoto H., Shiromoto K.: On generalized Hamming weights for codes over finite chain rings. Lect. Notes Comput. Sci. 2227, 141–150 (2001)
Huffman W.C., Pless V.S.: Fundamentals of Error-correcting Codes. Cambridge University Press, Cambridge (2003)
Norton G.H., Sălăgean A.: On the Hamming distance of linear codes over a finite chain ring. IEEE Trans. Inform. Theory 46, 1060–1067 (2000)
Tsfasman M.A., Vladut S.G.: Geometric approach to higher weights. IEEE Trans. Inform. Theory 41, 1564–1588 (1995)
Wei V.K.: Generalized Hamming weights for linear codes. IEEE Trans. Inform. Theory 37, 1412–1418 (1991)
Wood J.: Duality for modules over finite rings and applications to coding theory. Am. J. Math. 121, 555–575 (1999)
Author information
Authors and Affiliations
Corresponding author
Additional information
The author H. Liu is supported by the National Natural Science Foundation of China (10871079).
Rights and permissions
About this article
Cite this article
Dougherty, S.T., Han, S. & Liu, H. Higher weights for codes over rings. AAECC 22, 113–135 (2011). https://doi.org/10.1007/s00200-011-0140-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00200-011-0140-x