Add to ORKGThe paper gives a matrix-free presentation of the correspondence between full-length linear codes and projective multisets. It generalizes the Brouwer-Van Eupen construction that transforms projective codes into two-weight codes. Short proofs of known theorems are obtained. A new notion of self-duality in coding theory is explored
We describe a simple method to construct many different linear codes arising from caps in a projecti...
We determine the weight enumerator of the code of the projective plane of order 5 by hand. The main ...
It is well-known that few-weight linear codes have better applications in secret sharing schemes \ci...
The paper gives a matrix-free presentation of the correspondence between full-length linear codes an...
A projective multiset is a collection of projective points, which are not necessarily distinct. A li...
The hyperplanes intersecting a 2-weight code in the same number of points obviously form the point s...
We discuss the class of projective systems whose supports are the complement of the union of two lin...
The linear code C-s,C- (t)(n,q) of s-spaces and t-spaces in a projective space PG(n,q), q = p(h), p ...
A linear [n, k]-code C is a k-dimensional subspace of V (n, q), where V (n, q) denotes the n-dimensi...
We investigate self-dual codes from symmetric designs, specifically for the case when these designs ...
AbstractThe aim of this paper is to survey relationships between linear block codes over finite fiel...
AbstractWe construct new linear two-weight codes over the finite field with q elements. To do so we ...
AbstractBinary linear codes with length at most one above the Griesmer bound were proven to satisfy ...
AbstractThe notion of a projective system, defined as a set X of n-points in a projective space over...
AbstractWe present a brief survey of projective codes meeting the Griesmer bound. Methods for constr...
We describe a simple method to construct many different linear codes arising from caps in a projecti...
We determine the weight enumerator of the code of the projective plane of order 5 by hand. The main ...
It is well-known that few-weight linear codes have better applications in secret sharing schemes \ci...
The paper gives a matrix-free presentation of the correspondence between full-length linear codes an...
A projective multiset is a collection of projective points, which are not necessarily distinct. A li...
The hyperplanes intersecting a 2-weight code in the same number of points obviously form the point s...
We discuss the class of projective systems whose supports are the complement of the union of two lin...
The linear code C-s,C- (t)(n,q) of s-spaces and t-spaces in a projective space PG(n,q), q = p(h), p ...
A linear [n, k]-code C is a k-dimensional subspace of V (n, q), where V (n, q) denotes the n-dimensi...
We investigate self-dual codes from symmetric designs, specifically for the case when these designs ...
AbstractThe aim of this paper is to survey relationships between linear block codes over finite fiel...
AbstractWe construct new linear two-weight codes over the finite field with q elements. To do so we ...
AbstractBinary linear codes with length at most one above the Griesmer bound were proven to satisfy ...
AbstractThe notion of a projective system, defined as a set X of n-points in a projective space over...
AbstractWe present a brief survey of projective codes meeting the Griesmer bound. Methods for constr...
We describe a simple method to construct many different linear codes arising from caps in a projecti...
We determine the weight enumerator of the code of the projective plane of order 5 by hand. The main ...
It is well-known that few-weight linear codes have better applications in secret sharing schemes \ci...