Large sets of t-designs over finite fields exist for all t
From MaRDI portal
Publication:2153752
DOI10.1007/S10623-022-01061-ZzbMATH Open1493.05034OpenAlexW4281747399WikidataQ114849719 ScholiaQ114849719MaRDI QIDQ2153752FDOQ2153752
Publication date: 13 July 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-022-01061-z
Combinatorial aspects of block designs (05B05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
- Title not available (Why is that?)
- Designs over finite fields
- Designs and partial geometries over finite fields
- Association schemes and t-designs in regular semilattices
- Large sets of \(t\)-designs over finite fields
- EXISTENCE OF -ANALOGS OF STEINER SYSTEMS
- Coding for Errors and Erasures in Random Network Coding
- On a class of small 2‐designs over gf(q)
- 2-designs over \(GF(q)\)
- A new series of large sets of subspace designs over the binary field
- Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
- On the inequalities of \(t\)-designs over a finite field
- 2-designs over \(GF(2^ m)\)
- Large sets of subspace designs
- Title not available (Why is that?)
- Some new distance-4 constant weight codes
- Probabilistic existence of regular combinatorial structures
- q-analogues of t-designs and their existence
- Locally symmetric designs
- Title not available (Why is that?)
- Nontrivial \(t\)-designs over finite fields exist for all \(t\)
- Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
- Discrete \(q\)-distributions
- Probabilistic existence of large sets of designs
This page was built for publication: Large sets of \(t\)-designs over finite fields exist for all \(t\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2153752)
