Two-weight codes, partial geometries and Steiner systems (Q5926315): Difference between revisions

Two-weight codes and projective sets having two intersection sizes with hyperplanes are equivalent objects and they define strongly regular graphs. The authors construct sets in the projective space \(PG(2m-1,q)\) having the same intersection numbers with hyperplanes as \(Q^+(2m-1,q)\). They prove that if \(q=2\) the corresponding strongly regular graphs are switching equivalent and that, in particular, they contain subconstituents that are point graphs of partial geometries. Finally, in the last section, they prove that the partial geometries \(pg(7,8,4)\) are embeddable in Steiner systems \(S(2,8,120)\).