Weight hierarchies of linear codes of dimension 3
As the authors point out in the introduction, the knowledge of the weight hierarchy of linear codes is interesting for the implication it has in several aspects of the practical use of such codes in different scenarios. The problem is known to be difficult and many authors, as those mentioned in the references of the article, have contributed to solving some particular instances of it (codes of certain families like the product codes, Hermitian codes, etc., or codes that satisfy certain conditions like the chain condition, or codes up to a certain dimension). NEWLINENEWLINENEWLINEIn the present paper the authors study the hierarchy of the linear codes of dimension 3 over an arbitrary finite field and, in particular, obtain all the possible weight hierarchies for such codes when the field is of size at most 5. Instead of working directly with the hierarchy, they work with the equivalent concept of Difference Sequence (DS) and divide the problem into two subproblems, namely, finding the DS of codes of dimension 3 that satisfy the chain condition and finding the DS of those which do not satisfy the chain condition. In the first subproblem most of the results had already been obtained by the same authors in a previous unpublished work. Hence, the main novelty of the present paper is the collection of results concerning the second subproblem. The technique the authors use to achieve the results is based on the geometric study of the disposition of points on lines in the projective plane \(\text{PG}(2,q)\).
- Weight hierarchies of 11-ary linear codes of dimension 3
- A kind of three-weight linear codes
- A class of three-weight linear codes and their complete weight enumerators
- Three-weight linear codes from Weil sums
- Complete weight enumerators of a class of three-weight linear codes
- More constructions of 3-weight linear codes
- Complete weight enumerators of a family of three-weight linear codes
- Complete weight enumerators of three classes of linear codes
- Some two-weight and three-weight linear codes
- Weight hierarchies of linear codes satisfying the chain condition
- Codes satisfying the chain condition
- Dimension/length profiles and trellis complexity of linear block codes
- Generalized Hamming weights for linear codes
- Generalized Hamming weights of linear codes
- Maximum-likelihood soft decision decoding of BCH codes
- Minimum support weights of binary codes
- On the generalized Hamming weights of product codes
- On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes
- The weight distribution of irreducible cyclic codes with block lengths n₁ ((q^-1)/N)
- The weight hierarchies of q-ary codes of dimension 4
- The weight hierarchies of some product codes
- The worst case probability of undetected error for linear codes on the local binomial channel
- Weight hierarchies of binary linear codes of dimension 4
- Weight hierarchy of a product code
- Finite projective geometries and classification of the weight hierarchies of codes. I
- The determination on weight hierarchies of q-ary linear codes of dimension 5 in class IV
- On the relative generalized Hamming weights of a 4-dimensional linear code and a subcode with dimension one
- Weight hierarchies of 7-ary linear codes of dimension 3 and improved genetic algorithm
- Weight hierarchies of 11-ary linear codes of dimension 3
- The weight hierarchies of q-ary linear codes of dimension 4
This page was built for publication: Weight hierarchies of linear codes of dimension 3
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5934170)
