Skip to main content
Log in

The relative generalized Hamming weight of linear q-ary codes and their subcodes

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. 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)

    Article  MATH  MathSciNet  Google Scholar 

  2. 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)

    Article  MathSciNet  Google Scholar 

  3. Wei, V.K.: Generalized Hamming weight for linear codes. IEEE Trans. Inform. Theory 37(5), 1412–1418 (1991)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zihui Liu.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-008-9170-1

Keywords

AMS Classification

Navigation