Abstract
The weight hierarchy of a linear [ n , k ; q ] code C over G F ( 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 . In this paper, by using the finite projective geometry method, we determine almost all weight hierarchies of q -ary general linear codes of dimension 4.
Sign-in/Register to access full text options 
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.
