Abstract
In this article, some properties of the relative generalized Hamming weight (RGHW) of linear codes and their subcodes are developed with techniques in finite projective geometry. The relative generalized Hamming weights of almost all 4-dimensional q-ary linear codes and their subcodes are determined.
Similar content being viewed by others
References
Chen, W.D., Kløve, T.: The weight hierarchies of q-ary codes of dimension 4. IEEE Trans. Inform. Theory 42(6), 2265–2272 (1996)
Luo, Y., Mitrpant, C., Han Vinck, A.J., Chen, K.F.: Some new characters on the wire-tap channel of type II. IEEE Trans. Inform. Theory 51(3), 1222–1229 (2005)
Wei, V.K.: Generalized Hamming weight for linear codes. IEEE Trans. Inform. Theory 37(5), 1412–1418 (1991)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Liu, Z., Chen, W. & Luo, Y. The relative generalized Hamming weight of linear q-ary codes and their subcodes. Des. Codes Cryptogr. 48, 111–123 (2008). https://doi.org/10.1007/s10623-008-9170-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-008-9170-1
Keywords
- Relative generalized Hamming weight
- Linear codes
- Finite projective geometry
- Relative difference sequence