Residual \(q\)-Fano planes and related structures

zbMath1391.05068arXiv1704.07714MaRDI QIDQ1753097

Niv Hooker, Tuvi Etzion

Publication date: 25 May 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

spreadsderived designresidual design\(q\)-analog\(q\)-Fano plane\(q\)-Steiner systems

Mathematics Subject Classification ID

Steiner systems in finite geometry (51E10) Combinatorial aspects of finite geometries (05B25)

Related Items

Subspace packings: constructions and bounds ⋮ A new approach for examining \(q\)-Steiner systems ⋮ Generalized vector space partitions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nontrivial \(t\)-designs over finite fields exist for all \(t\)
• On the automorphism group of a binary \(q\)-analog of the Fano plane
• Galois geometries and coding theory
• Designs over finite fields
• Designs and partial geometries over finite fields
• 2-designs over \(GF(q)\)
• Association schemes and t-designs in regular semilattices
• Parallelismen in unendlichen projektiven Räumen endlicher Dimension
• Codes and anticodes in the Grassman graph
• A new approach for examining \(q\)-Steiner systems
• Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
• On the inequalities of \(t\)-designs over a finite field
• q-analogues of t-designs and their existence
• On parallelisms in finite projective spaces
• Locally symmetric designs
• Quotient sets and subset-subspace analogy
• Derived and residual subspace designs
• On \(q\)-analogs of Steiner systems and covering designs
• 2-designs over \(GF(2^ m)\)
• EXISTENCE OF -ANALOGS OF STEINER SYSTEMS
• Coding for Errors and Erasures in Random Network Coding
• Leonhard Euler and a 𝑞-analogue of the logarithm
• Projective Geometry over  1 and the Gaussian Binomial Coefficients
• On a class of small 2‐designs over gf(q)
• Grassmannian Codes With New Distance Measures for Network Coding
• Error-Correcting Codes in Projective Space
• Maximal consistent families of triples
• On the Foundations of Combinatorial Theory IV Finite Vector Spaces and Eulerian Generating Functions
• On perfect codes and related concepts