Some New Cyclotomic Strongly Regular Graphs
Journal of Algebraic Combinatorics: An International Journal
Sets of type (m, n) in the affine and projective planes of order nine
Designs, Codes and Cryptography
Two new optimal ternary two-weight codes and strongly regular graphs
Discrete Mathematics
Two-Weight Codes, Partial Geometries and Steiner Systems
Designs, Codes and Cryptography
The Discovery of Simple 7-Designs with Automorphism Group PTL (2, 32)
AAECC-11 Proceedings of the 11th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Combinatorial and computational aspects of finite geometries
Combinatorial and computational aspects of finite geometries
Systematic construction of q-analogs of t - (v, k, λ)-designs
Designs, Codes and Cryptography
Projective two-weight codes with small parameters and their corresponding graphs
Designs, Codes and Cryptography
Error-Correcting Linear Codes: Classification by Isometry and Applications (Algorithms and Computation in Mathematics)
Some new results for ternary linear codes of dimension 5 and 6
IEEE Transactions on Information Theory - Part 2
Construction of linear codes with large minimum distance
IEEE Transactions on Information Theory
Optimal linear codes from matrix groups
IEEE Transactions on Information Theory
The geometry of some two-character sets
Designs, Codes and Cryptography
Discrete Applied Mathematics
Cyclotomy over products of finite fields and combinatorial applications
European Journal of Combinatorics
| Hi-index | 0.04 |
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.