DOIAbstract
We survey the relationships between two-weight linear [n, k] codes over GF(q), projective (n, k, h1, h2,) sets in PG(k — 1,q), and certain strongly regular graphs. We also describe and tabulate essentially all the known examples
We survey the relationships between two-weight linear [n, k] codes over GF(q), projective (n, k, h1, h2,) sets in PG(k — 1,q), and certain strongly regular graphs. We also describe and tabulate essentially all the known examples
A linear [n, k]-code C is a k-dimensional subspace of V (n, q), where V (n, q) denotes the n-dimensi...
A projective multiset is a collection of projective points, which are not necessarily distinct. A li...
International audienceWe construct strongly walk-regular graphs as coset graphs of the duals of code...
AbstractWe construct new linear two-weight codes over the finite field with q elements. To do so we ...
AbstractIt is well known that two-weight codes result in strongly regular graphs if the code is proj...
It is well known (and due to Delsarte [3]) that the three concepts (i) two-weight projective code, (...
AbstractIt is well known (and due to Delsarte [3]) that the three concepts (i) two-weight projective...
AbstractDelsarte showed that for any projective linear code over a finite field GF(pr) with two nonz...
AbstractStarting from a theorem on the distance matrix of a projective linear code, one introduces a...
AbstractIt is well known that two-weight codes result in strongly regular graphs if the code is proj...
The hyperplanes intersecting a 2-weight code in the same number of points obviously form the point s...
By a classical result of Bonisoli, the equidistant linear codes over GF(q) are, up to monomial equiv...
International audienceLet p be a prime number. Reducible cyclic codes of rank 2 over Z p m are shown...
Twelve new strongly regular graphs with parameters (81, 30, 9, 12) are found as graphs invariant und...
A linear [n, k]-code C is a k-dimensional subspace of V (n, q), where V (n, q) denotes the n-dimensi...
A projective multiset is a collection of projective points, which are not necessarily distinct. A li...
International audienceWe construct strongly walk-regular graphs as coset graphs of the duals of code...
AbstractWe construct new linear two-weight codes over the finite field with q elements. To do so we ...
AbstractIt is well known that two-weight codes result in strongly regular graphs if the code is proj...
It is well known (and due to Delsarte [3]) that the three concepts (i) two-weight projective code, (...
AbstractIt is well known (and due to Delsarte [3]) that the three concepts (i) two-weight projective...
AbstractDelsarte showed that for any projective linear code over a finite field GF(pr) with two nonz...
AbstractStarting from a theorem on the distance matrix of a projective linear code, one introduces a...
AbstractIt is well known that two-weight codes result in strongly regular graphs if the code is proj...
The hyperplanes intersecting a 2-weight code in the same number of points obviously form the point s...
By a classical result of Bonisoli, the equidistant linear codes over GF(q) are, up to monomial equiv...
International audienceLet p be a prime number. Reducible cyclic codes of rank 2 over Z p m are shown...
Twelve new strongly regular graphs with parameters (81, 30, 9, 12) are found as graphs invariant und...
A linear [n, k]-code C is a k-dimensional subspace of V (n, q), where V (n, q) denotes the n-dimensi...
A projective multiset is a collection of projective points, which are not necessarily distinct. A li...
International audienceWe construct strongly walk-regular graphs as coset graphs of the duals of code...
Add to ORKG