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.
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 callMore From: Applicable Algebra in Engineering, Communication and Computing
Disclaimer: 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.
