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- design over for every integer 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 . In this way, we also find the first infinite family of non-trivial cyclic group divisible designs over .
Recommendations
Cites work
- scientific article; zbMATH DE number 1229693 (Why is no real title available?)
- scientific article; zbMATH DE number 1101474 (Why is no real title available?)
- scientific article; zbMATH DE number 1382769 (Why is no real title available?)
- Designs over finite fields
- Existence of \(q\)-analogs of Steiner systems
- \(q\)-analogs of group divisible designs
Cited in
(14)- Cyclic balanced sampling plans excluding contiguous units with block size four
- The completion of optimal cyclic quaternary codes of weight 3 and distance 3
- Additivity of symmetric and subspace 2-designs
- Graph decompositions in projective geometries
- Construction of transitive \(q\)-analogs of designs
- Designs over the binary field from the complete monomial group
- A new family of additive designs
- scientific article; zbMATH DE number 2061147 (Why is no real title available?)
- Tactical decompositions of designs over finite fields
- A quasidouble of the affine plane of order 4 and the solution of a problem on additive designs
- Super-regular Steiner 2-designs
- Constructions of new matroids and designs over \(\mathbb{F}_q\)
- Fano kaleidoscopes and their generalizations
- Binary Hamming codes and Boolean designs
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)