Skip to main content
SpringerLink
Log in

Bounds on the Weight Hierarchies of Extremal Non-chain Codes of Dimension 4

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract.

 The weight hierarchy of a linear [n, k; q] code C over GF(q) is the sequence (d 1, d 2, . . . , d k ) where d r is the smallest support of an r-dimensional subcode of C. An [n, k; q] code is external non-chain if for any r and s, where 1≦r<s≦k, there are no subspaces D and E, such that D⊂E, dim D=r, dim E=s, w S (D)=d r , and w S (E)=d s . Bounds on the weight hierarchies of such codes of dimension 4 are studied.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

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

    Wende Chen

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

    Torleiv Kløve

Authors
  1. Wende Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Torleiv Kløve
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: September 27, 1996

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, W., Kløve, T. Bounds on the Weight Hierarchies of Extremal Non-chain Codes of Dimension 4. AAECC 8, 379–386 (1997). https://doi.org/10.1007/s002000050075

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002000050075

Search

Navigation