Our main result is a non-existence theorem for certain families of lines in three dimensional projective spacePG(3, q) over a finite fieldGF (q). Specifically, a Cameron-Liebler line class in PG(3,â€¦ (More)

The connection between maximal caps (sometimes called complete caps) and certain binary codes called quasi-perfect codes is described. We provide a geometric approach to the foundational work ofâ€¦ (More)

Shift registers are at the heart of cryptography and error-correction. In cryptography they are the main tool for generating long pseudorandom binary sequences which can be used as keys for twoâ€¦ (More)

Hill [6] showed that the largest cap in PG(5, 3) has cardinality 56. Using this cap it is easy to construct a cap of cardinality 45 inAG(5, 3). Here we show that the size of a cap in AG(5, 3) isâ€¦ (More)

The notion of a blocking set in various structures has been studied extensively since it occurs in a variety of contexts (see for example [6]). For the case of a projective plane rc recall that aâ€¦ (More)

We obtain, in principle, a complete classification of all long inextendable binary linear codes. Several related constructions and results are presented.

Given any linear code C over a finite field GF (q) we show how C can be described in a transparent and geometrical way by using the associated Bruen-Silverman code. Then, specializing to the case ofâ€¦ (More)