Some new two-weight codes and strongly regular graphs (Q2266697): Difference between revisions

It is well known (and due to Delsarte) that the three concepts (i) two- weight projective code, (ii) strongly regular graph defined by a difference set in a vector space, and (iii)) subset X of a projective space such that \(| X\cap H|\) takes only two values when H runs over all hyperplanes, are equivalent. Here we construct some new examples (formulated as in (iii)) by taking a quadric defined over a small field and cutting out a quadric defined over a larger field.