Weight Hierarchies of Linear Codes Satisfying the Chain Condition | Designs, Codes and Cryptography Skip to main content
Springer Nature Link
Log in

Weight Hierarchies of Linear Codes Satisfying the Chain Condition

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

Abstract

The weight hierarchy of a linear [n,k;q] code C over GF(q) is the sequence (d1,d2,...,dk) where dr is the smallest support of an r–dimensional subcode of C. By explicit construction, it is shown that if a sequence (a1,a2,...,ak) satisfies certain conditions, then it is the weight hierarchy of a code satisfying the chain condition.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. I. Barbero and J. G. Tena, Weight hierarchy of a product code, IEEE Trans. Inform. Theory, Vol. 41, No.5 (1995) pp. 1475-1479.

    Google Scholar 

  2. W. Chen and T. Kløve, The weight hierarchies of q-ary codes of dimension 4, IEEE Trans. Inform. Theory, Vol. 42, No.6 (1996) pp. 2265-2272.

    Google Scholar 

  3. S. Encheva and T. Kløve, Codes satisfying the chain condition, IEEE Trans. Inform. Theory, Vol. 40, No.1 (1994) pp. 175-180.

    Google Scholar 

  4. G. D. Forney, Dimension/length profiles and trellis complexity of linear block codes, IEEE Trans. Inform. Theory, Vol. 40, No.6 (1994) pp. 1741-1752.

    Google Scholar 

  5. T. Helleseth and T. Kløve, The weight hierarchies of some product codes, IEEE Trans. Inform. Theory, Vol. 42, No.3 (1996) pp. 1029-1034.

    Google Scholar 

  6. T. Helleseth, T. Kløve and Ø. Ytrehus, Generalized Hamming weights of linear codes, IEEE Trans. Inform. Theory, Vol. 38, No.3 (1992) pp. 1133-1140.

    Google Scholar 

  7. T. Kasami, T. Takata, T. Fujiwara and S. Lin, On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes, IEEE Trans. Inform. Theory, Vol. 39, No.1 (1993) pp. 242-243.

    Google Scholar 

  8. A. Vardy and Y. Be'ery, Maximum-likelihood soft decision decoding of BCH codes, IEEE Trans. Inform. Theory, Vol. 40, No.2 (1994) pp. 546-554.

    Google Scholar 

  9. V. K. Wei and K. Yang, On the generalized Hamming weights of product codes, IEEE Trans. Inform. Theory, Vol. 39, No.5 (1993) pp. 1709-1713.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Academia Sinica and Key State Lab. of Information Security, Graduate School of Academia Sinica, Institute of Systems Science, Beijing, 100080, China

    Wende Chen

  2. Department of Informatics, University of Bergen, HIB, N-5020, Bergen, Norway

    Torleiv Klove

Authors
  1. Wende Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Torleiv Klove
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, W., Klove, T. Weight Hierarchies of Linear Codes Satisfying the Chain Condition. Designs, Codes and Cryptography 15, 47–66 (1998). https://doi.org/10.1023/A:1008225524987

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008225524987

Search

Navigation