1 - 10 of 30 articles
We survey the relationships between two‐weight linear [n, k] codes over GF(q), projective (n, k, h1, h2) sets in PG(k − 1, q), and certain strongly regular graphs. We also describe and tabulate essentially all the known examples.
We use sharply 2‐transitive permutation groups to construct an additive sequence of permutations from a system of difference sets, each component of which has size one less than a prime power. This allows us to combine perfect systems of difference sets to form other perfect systems. In...
Using theorems of Redéi, and of Brouwer and Schrijver, and Jamison, it is proved that a non‐trivial blocking set in a desarguesian projective plane of order q has at least q + √(2q) + 1 points, if q is at least 7, odd and not a square and q ¦ 27. Further one can show that non‐trivial blocking...
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.