Abstract
Certain equivalent conditions are given for the semilinear equivalence of linear codes by using the relative generalized Hamming weight and the value function.
Similar content being viewed by others
References
Liu H W. Generalized Hamming weights and semilinear equivalence of codes (in Chinese). Acta Math Sci, 2006, 26A: 766–772
MacWilliams F J. Combinatorial properties of elementary abelian groups. Ph.D. thesis. Radcliffe College, Cambridge, Mass., 1962
Wei V K. Generalized Hamming weight for linear codes. IEEE Trans Inf Theory, 1991, 37: 1412–1418
Luo Y, Mitrpant C, Han Vinck A J, et al. Some new characters on the wire-tap channel of type II. IEEE Trans Inf Theory, 2005, 51: 1222–1229
Ozarow L H, Wyner A D. Wire-tap channel II. AT&T Bell Lab Tech J, 1984, 63: 2135–2157
Chen W D, Kløve T. The weight hierarchies of q-ary codes of dimension 4. IEEE Trans Inf Theory, 1996, 42: 2265–2272
Liu Z H, Chen W D, Luo Y. The relative generalized Hamming weight of linear q-ary codes and their subcodes. Des Codes Cryptogr, 2008, 48: 111–123
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Liu, Z., Wang, J. The relative generalized Hamming weight and the semilinear equivalence of codes. Sci. China Inf. Sci. 54, 787–794 (2011). https://doi.org/10.1007/s11432-010-4143-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-010-4143-1