Large sets of t-designs over finite fields exist for all t
From MaRDI portal
Publication:2153752
Recommendations
Cites work
- scientific article; zbMATH DE number 3467122 (Why is no real title available?)
- 2-designs over \(GF(2^ m)\)
- 2-designs over GF(q)
- A new series of large sets of subspace designs over the binary field
- Association schemes and t-designs in regular semilattices
- Coding for Errors and Erasures in Random Network Coding
- Designs and partial geometries over finite fields
- Designs over finite fields
- Discrete \(q\)-distributions
- Existence of \(q\)-analogs of Steiner systems
- Large sets of \(t\)-designs over finite fields
- Large sets of subspace designs
- Locally symmetric designs
- Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
- Nontrivial t-designs over finite fields exist for all t
- On a class of small 2‐designs over gf(q)
- On the inequalities of t-designs over a finite field
- Probabilistic existence of regular combinatorial structures
- Some new designs over finite fields
- Some new distance-4 constant weight codes
- Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
- The CRC handbook of combinatorial designs
- q-analogues of t-designs and their existence
Cited in
(5)
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)