We construct self-orthogonal codes from the row span over F2 or F3 of the adjacency matrices of some strongly regular graphs defined by the rank-3 action of the simple unitary group U4(3) on the conjugacy classes of some of its maximal subgroups. We establish some properties of these codes and the nature of some classes of codewords
Please read abstract in the article.The National Research Foundation of South Africahttp://aimscienc...
International audienceThere is a local ring E of order 4, without identity for the multiplication, d...
AbstractThe stabilizers of the minimum-weight codewords of dual binary codes obtained from the stron...
We construct self-orthogonal codes from the row span over F2 or F3 of the adjacency matrices of some...
We show that under certain conditions submatrices of orbit matrices of strongly regular graphs span ...
We show that under certain conditions submatrices of orbit matrices of strongly regular graphs span ...
We show that under certain conditions submatrices of orbit matrices of strongly regular graphs span ...
Strongly regular graphs are certain very regular structures found in statistical design, finite grou...
Philosophiae Doctor - PhD (Mathematics)The main theme of this thesis is the construction of linear ...
We show a construction of the projective plane PG(2,16) and the Hermitian unital S(2,5,65) from the ...
We show a construction of the projective plane PG(2,16) and the Hermitian unital S(2,5,65) from the ...
AbstractThe enumeration of strongly regular graphs with parameters (45, 12, 3, 3) has been completed...
AbstractThe enumeration of strongly regular graphs with parameters (45, 12, 3, 3) has been completed...
There is a non-unital ring I of order 4 defined by generators and relations as I = a, b | 2a = 2b = ...
The adjacency matrix of a graph can be interpreted as the incidence matrix of a design, or as the ge...
Please read abstract in the article.The National Research Foundation of South Africahttp://aimscienc...
International audienceThere is a local ring E of order 4, without identity for the multiplication, d...
AbstractThe stabilizers of the minimum-weight codewords of dual binary codes obtained from the stron...
We construct self-orthogonal codes from the row span over F2 or F3 of the adjacency matrices of some...
We show that under certain conditions submatrices of orbit matrices of strongly regular graphs span ...
We show that under certain conditions submatrices of orbit matrices of strongly regular graphs span ...
We show that under certain conditions submatrices of orbit matrices of strongly regular graphs span ...
Strongly regular graphs are certain very regular structures found in statistical design, finite grou...
Philosophiae Doctor - PhD (Mathematics)The main theme of this thesis is the construction of linear ...
We show a construction of the projective plane PG(2,16) and the Hermitian unital S(2,5,65) from the ...
We show a construction of the projective plane PG(2,16) and the Hermitian unital S(2,5,65) from the ...
AbstractThe enumeration of strongly regular graphs with parameters (45, 12, 3, 3) has been completed...
AbstractThe enumeration of strongly regular graphs with parameters (45, 12, 3, 3) has been completed...
There is a non-unital ring I of order 4 defined by generators and relations as I = a, b | 2a = 2b = ...
The adjacency matrix of a graph can be interpreted as the incidence matrix of a design, or as the ge...
Please read abstract in the article.The National Research Foundation of South Africahttp://aimscienc...
International audienceThere is a local ring E of order 4, without identity for the multiplication, d...
AbstractThe stabilizers of the minimum-weight codewords of dual binary codes obtained from the stron...