Large sets of \(t\)-designs over finite fields

DOI10.1016/j.jcta.2014.01.008zbMath1283.05035arXiv1305.1455OpenAlexW2009214945MaRDI QIDQ2439574

Alfred Wassermann, Michael Braun, Axel Kohnert, Patric R. J. Östergård

Publication date: 14 March 2014

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

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

zbMATH Keywords

automorphism grouplarge sets\(q\)-analogsdesigns over finite fields

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30) Designs and configurations (05B99)

Related Items (13)

New infinite series of 2-designs over the binary and ternary field ⋮ Large sets of \(t\)-designs over finite fields exist for all \(t\) ⋮ Unnamed Item ⋮ A new series of large sets of subspace designs over the binary field ⋮ Subspace packings: constructions and bounds ⋮ Galois geometries and coding theory ⋮ New 2-designs over finite fields from derived and residual designs ⋮ Large sets of subspace designs ⋮ Disjoint \(q\)-Steiner systems in dimension 13 ⋮ New Lower Bounds for Binary Constant-Dimension Subspace Codes ⋮ A construction of group divisible designs with block sizes 3 to 7 ⋮ Derived and residual subspace designs ⋮ Search for combinatorial objects using lattice algorithms -- revisited

Uses Software

• DISCRETA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On regular parallelisms in PG(3,q)
• Designs over finite fields
• 2-designs over \(GF(q)\)
• Partitioning the planes of \(AG_{2m}(2)\) into 2-designs
• Association schemes and t-designs in regular semilattices
• t-designs on hypergraphs
• Regular packings of \(PG(3,q)\)
• A large set of designs on vector spaces
• A new family of 2-designs over GF\((q)\) admitting SL\(_m(q^l)\)
• Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
• Locally trivial t-designs and t-designs without repeated blocks
• On parallelisms in finite projective spaces
• Locally symmetric designs
• 2-designs over \(GF(2^ m)\)
• EXISTENCE OF -ANALOGS OF STEINER SYSTEMS
• New large sets oft-designs with prescribed groups of automorphisms
• Coding for Errors and Erasures in Random Network Coding
• On a class of small 2‐designs over gf(q)

This page was built for publication: Large sets of \(t\)-designs over finite fields