Add to ORKGInternational audienceLet p be a prime number. Reducible cyclic codes of rank 2 over Z p m are shown to have exactly two Hamming weights in some cases. Their weight distribution is computed explicitly. When these codes are projective the coset graphs of their dual codes are strongly regular. The spectra of the these graphs are determined
Abstract. We prove, without assuming the Generalized Riemann Hypothesis, but with at most one except...
International audienceWe construct strongly walk-regular graphs as coset graphs of the duals of thre...
The objectives of this paper are to survey and extend earlier results on the weight distributions of...
AbstractIt is well known that two-weight codes result in strongly regular graphs if the code is proj...
International audienceWe construct strongly walk-regular graphs as coset graphs of the duals of code...
We survey the relationships between two-weight linear [n, k] codes over GF(q), projective (n, k, h1,...
AbstractIt is well known that two-weight codes result in strongly regular graphs if the code is proj...
AbstractStarting from a theorem on the distance matrix of a projective linear code, one introduces a...
AbstractDelsarte showed that for any projective linear code over a finite field GF(pr) with two nonz...
It is well known (and due to Delsarte [3]) that the three concepts (i) two-weight projective code, (...
AbstractWe construct new linear two-weight codes over the finite field with q elements. To do so we ...
AbstractIt is well known (and due to Delsarte [3]) that the three concepts (i) two-weight projective...
Strongly regular graphs are certain very regular structures found in statistical design, finite grou...
Revised version. The automorphism-group part essentially updated (in the previous versions, it conta...
Abstract. For strongly regular graphs with adjacency matrix A, we look at the binary codes generated...
Abstract. We prove, without assuming the Generalized Riemann Hypothesis, but with at most one except...
International audienceWe construct strongly walk-regular graphs as coset graphs of the duals of thre...
The objectives of this paper are to survey and extend earlier results on the weight distributions of...
AbstractIt is well known that two-weight codes result in strongly regular graphs if the code is proj...
International audienceWe construct strongly walk-regular graphs as coset graphs of the duals of code...
We survey the relationships between two-weight linear [n, k] codes over GF(q), projective (n, k, h1,...
AbstractIt is well known that two-weight codes result in strongly regular graphs if the code is proj...
AbstractStarting from a theorem on the distance matrix of a projective linear code, one introduces a...
AbstractDelsarte showed that for any projective linear code over a finite field GF(pr) with two nonz...
It is well known (and due to Delsarte [3]) that the three concepts (i) two-weight projective code, (...
AbstractWe construct new linear two-weight codes over the finite field with q elements. To do so we ...
AbstractIt is well known (and due to Delsarte [3]) that the three concepts (i) two-weight projective...
Strongly regular graphs are certain very regular structures found in statistical design, finite grou...
Revised version. The automorphism-group part essentially updated (in the previous versions, it conta...
Abstract. For strongly regular graphs with adjacency matrix A, we look at the binary codes generated...
Abstract. We prove, without assuming the Generalized Riemann Hypothesis, but with at most one except...
International audienceWe construct strongly walk-regular graphs as coset graphs of the duals of thre...
The objectives of this paper are to survey and extend earlier results on the weight distributions of...