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 weight of an r-dimensional subcode of C . Linear codes may be classified according to a set of chain and non-chain conditions, the extreme cases being codes satisfying the chain condition (due to Wei and Yang) and extremal, non-chain codes (due to Chen and Kl øve). This paper gives upper bounds on the weight hierarchies of the latter class of codes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
