Designs over finite fields by difference methods

From MaRDI portal
Publication:2422158




Abstract: One of the very first results about designs over finite fields, by S. Thomas, is the existence of a cyclic 2-(n,3,7) design over mathbbF2 for every integer n coprime with 6. Here, by means of difference methods, we reprove and improve a little bit this result showing that it is true, more generally, for every odd n. In this way, we also find the first infinite family of non-trivial cyclic group divisible designs over mathbbF2.









This page was built for publication: Designs over finite fields by difference methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2422158)