Designs over finite fields by difference methods
From MaRDI portal
Publication:2422158
DOI10.1016/J.FFA.2019.02.006zbMATH Open1448.05020arXiv1808.06657OpenAlexW3100652480WikidataQ128384231 ScholiaQ128384231MaRDI QIDQ2422158FDOQ2422158
Publication date: 18 June 2019
Published in: Finite Fields and their Applications (Search for Journal in Brave)
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 .
Full work available at URL: https://arxiv.org/abs/1808.06657
Recommendations
Combinatorial aspects of block designs (05B05) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)
Cites Work
Cited In (13)
- 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
- A new family of additive designs
- Title not available (Why is that?)
- A quasidouble of the affine plane of order 4 and the solution of a problem on additive designs
- Tactical decompositions of designs over finite fields
- 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)