Constructing two-weight codes with prescribed groups of automorphisms (Q997071)

In this paper, new linear two-weight codes are constructed. To obtain these results the authors solve the equivalent problem of finding point sets in the projective geometry with given intersection properties. These point sets are constructed as a solution of a Diophantine system of linear equations. The authors apply a method to shrink this system by prescribing a group of automorphisms. The obtained results about two-weight codes are used to define strongly regular graphs. The authors give tables of the two-weight codes and their corresponding strongly regular graphs.