Name
Abstract | ||
|---|---|---|
We construct new linear two-weight codes over the finite field with q elements. To do so we solve the equivalent problem of finding point sets in the projective geometry with certain intersection properties. These point sets are in bijection to solutions of a Diophantine linear system of equations. To reduce the size of the system of equations we restrict the search for solutions to solutions with special symmetries. Two-weight codes can be used to define strongly regular graphs. We give tables of the two-weight codes and the corresponding strongly regular graphs. In some cases we find new distance-optimal two-weight codes and also new strongly regular graphs. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.dam.2007.03.006 | Discrete Applied Mathematics |
Keywords | Field | DocType |
prescribed group,certain intersection property,equivalent problem,two-weight codes,new distance-optimal two-weight code,new linear two-weight code,two-weight code,finite projective geometry,finite field,projective geometry,diophantine linear system,regular graph,point set,strongly regular graphs,linear system of equations,system of equations,strongly regular graph | Discrete mathematics,Combinatorics,Finite field,Bijection,System of linear equations,Projective geometry,Block code,Regular graph,Linear code,Diophantine equation,Mathematics | Journal |
Volume | Issue | ISSN |
155 | 11 | Discrete Applied Mathematics |
Citations | PageRank | References |
8 | 0.94 | 10 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Axel Kohnert | 1 | 114 | 12.60 |