We use projective multisets (projective systems) to find upper bounds on the weight hierarchies for a special class of codes, namely the extremal non-chain codes. Several code constructions exist meeting the bounds with equality</p
The paper gives a matrix-free presentation of the correspondence between full-length linear codes an...
AbstractThe weight hierarchies and generalized weight spectra of the projective codes from degenerat...
AbstractWe present a brief survey of projective codes meeting the Griesmer bound. Methods for constr...
We use projective multisets (projective systems) to find upper bounds on the weight hierarchies for ...
AbstractThe weight hierarchy of a linear [n,k;q] code C over GF(q) is the sequence (d1,d2,…,dk) wher...
The upper bound of weight hierarchies of codes with a divided-chain of arbitrary continuous break po...
A projective multiset is a collection of projective points, which are not necessarily distinct. A li...
AbstractThe weight hierarchy of a linear [n,k;q] code C over GF(q) is the sequence (d1,d2,…,dk) wher...
A projective multiset is a collection of projective points, which are not necessarily distinct. A li...
We present the relation between product codes and projective multisets, and give a lower bound on th...
We present the relation between product codes and projective multisets, and give a lower bound on th...
AbstractThe notion of a projective system, defined as a set X of n-points in a projective space over...
The hyperplanes intersecting a 2-weight code in the same number of points obviously form the point s...
AbstractThe weight hierarchies and generalized weight spectra of the projective codes from degenerat...
The hyperplanes intersecting a 2-weight code in the same number of points obviously form the point s...
The paper gives a matrix-free presentation of the correspondence between full-length linear codes an...
AbstractThe weight hierarchies and generalized weight spectra of the projective codes from degenerat...
AbstractWe present a brief survey of projective codes meeting the Griesmer bound. Methods for constr...
We use projective multisets (projective systems) to find upper bounds on the weight hierarchies for ...
AbstractThe weight hierarchy of a linear [n,k;q] code C over GF(q) is the sequence (d1,d2,…,dk) wher...
The upper bound of weight hierarchies of codes with a divided-chain of arbitrary continuous break po...
A projective multiset is a collection of projective points, which are not necessarily distinct. A li...
AbstractThe weight hierarchy of a linear [n,k;q] code C over GF(q) is the sequence (d1,d2,…,dk) wher...
A projective multiset is a collection of projective points, which are not necessarily distinct. A li...
We present the relation between product codes and projective multisets, and give a lower bound on th...
We present the relation between product codes and projective multisets, and give a lower bound on th...
AbstractThe notion of a projective system, defined as a set X of n-points in a projective space over...
The hyperplanes intersecting a 2-weight code in the same number of points obviously form the point s...
AbstractThe weight hierarchies and generalized weight spectra of the projective codes from degenerat...
The hyperplanes intersecting a 2-weight code in the same number of points obviously form the point s...
The paper gives a matrix-free presentation of the correspondence between full-length linear codes an...
AbstractThe weight hierarchies and generalized weight spectra of the projective codes from degenerat...
AbstractWe present a brief survey of projective codes meeting the Griesmer bound. Methods for constr...
DOI
Add to ORKG