Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
From MaRDI portal
Publication:1766097
DOI10.1007/s10623-003-4194-zzbMath1055.05009OpenAlexW2084294183MaRDI QIDQ1766097
Adalbert Kerber, Michael Braun, Reinhard Laue
Publication date: 28 February 2005
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-003-4194-z
Related Items (31)
New infinite series of 2-designs over the binary and ternary field ⋮ Completely regular codes in Johnson and Grassmann graphs with small covering radii ⋮ Large sets of \(t\)-designs over finite fields exist for all \(t\) ⋮ q-Analogs of Packing Designs ⋮ Unnamed Item ⋮ Nontrivial \(t\)-designs over finite fields exist for all \(t\) ⋮ On \(\lambda \)-fold partitions of finite vector spaces and duality ⋮ The order of the automorphism group of a binary \(q\)-analog of the Fano plane is at most two ⋮ A new series of large sets of subspace designs over the binary field ⋮ A generalization of the Erdős-Ko-Rado theorem to \(t\)-designs in certain semilattices ⋮ Dual incidences and t‐designs in vector spaces ⋮ Graph decompositions in projective geometries ⋮ Subspace packings: constructions and bounds ⋮ Galois geometries and coding theory ⋮ EXISTENCE OF -ANALOGS OF STEINER SYSTEMS ⋮ Constructions of new matroids and designs over \(\mathbb{F}_q\) ⋮ Large sets of \(t\)-designs over finite fields ⋮ New 2-designs over finite fields from derived and residual designs ⋮ On the automorphism group of a binary \(q\)-analog of the Fano plane ⋮ Tactical decompositions of designs over finite fields ⋮ Large sets of subspace designs ⋮ Disjoint \(q\)-Steiner systems in dimension 13 ⋮ New Lower Bounds for Binary Constant-Dimension Subspace Codes ⋮ Covering of subspaces by subspaces ⋮ Residual \(q\)-Fano planes and related structures ⋮ Intersection Numbers For Subspace Designs ⋮ Derived and residual subspace designs ⋮ Constructing two-weight codes with prescribed groups of automorphisms ⋮ \(q\)-analogs of \(t\)-wise balanced designs from Borel subgroups ⋮ An Assmus--Mattson Theorem for Rank Metric Codes ⋮ Search for combinatorial objects using lattice algorithms -- revisited
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Designs over finite fields
- Designs and partial geometries over finite fields
- 2-designs over \(GF(q)\)
- t-designs on hypergraphs
- Group actions, double cosets, and homomorphisms: Unifying concepts for the constructive theory of discrete structures
- A new family of 2-designs over GF\((q)\) admitting SL\(_m(q^l)\)
- The t‐designs with prescribed automorphism group, new simple 6‐designs
This page was built for publication: Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
