Nontrivial \(t\)-designs over finite fields exist for all \(t\)

DOI10.1016/j.jcta.2014.06.001zbMath1297.05046arXiv1306.2088OpenAlexW1980888721MaRDI QIDQ406567

Alexander Vardy, Arman Fazeli, Shachar Lovett

Publication date: 8 September 2014

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.2088

zbMATH Keywords

combinatorial designs\(q\)-analogsdesigns over fieldsKLP theoremTeirlinck theorem

Mathematics Subject Classification ID

Other designs, configurations (05B30)

Related Items

New constructions of Sidon spaces, Large sets of \(t\)-designs over finite fields exist for all \(t\), Unnamed Item, Combinatorics. Abstracts from the workshop held January 1--7, 2023, Existence of small ordered orthogonal arrays, To the theory of \(q\)-ary Steiner and other-type trades, Degree 2 Boolean functions on Grassmann graphs, New lower bounds for partial k‐parallelisms, Galois geometries and coding theory, EXISTENCE OF -ANALOGS OF STEINER SYSTEMS, Large sets of subspace designs, A construction of group divisible designs with block sizes 3 to 7, Residual \(q\)-Fano planes and related structures, Intersection Numbers For Subspace Designs, Derived and residual subspace designs, \(q\)-analogs of \(t\)-wise balanced designs from Borel subgroups, An Assmus--Mattson Theorem for Rank Metric Codes

Cites Work

• Unnamed Item
• Unnamed Item
• Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
• Designs over finite fields
• Designs and partial geometries over finite fields
• 2-designs over \(GF(q)\)
• Association schemes and t-designs in regular semilattices
• Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
• q-analogues of t-designs and their existence
• Locally symmetric designs
• Quotient sets and subset-subspace analogy
• On \(q\)-analogs of Steiner systems and covering designs
• 2-designs over \(GF(2^ m)\)
• Coding for Errors and Erasures in Random Network Coding
• Projective Geometry over  1 and the Gaussian Binomial Coefficients
• On a class of small 2‐designs over gf(q)
• Error-Correcting Codes in Projective Space
• Probabilistic existence of rigid combinatorial structures
• On the Foundations of Combinatorial Theory IV Finite Vector Spaces and Eulerian Generating Functions