EXISTENCE OF -ANALOGS OF STEINER SYSTEMS

DOI10.1017/fmp.2016.5zbMath1372.51003arXiv1304.1462OpenAlexW1876525288MaRDI QIDQ2971026

Tuvi Etzion, Michael Braun, Patric R. J. Östergård, Alexander Vardy, Alfred Wassermann

Publication date: 4 April 2017

Published in: Forum of Mathematics, Pi (Search for Journal in Brave)

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

zbMATH Keywords

automorphism groupsSinger cyclesdesigns over finite fields\(q\)-Steiner systems

Mathematics Subject Classification ID

Other designs, configurations (05B30) Steiner systems in finite geometry (51E10) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)

Related Items (63)

Packings and Steiner systems in polar spaces ⋮ On the extendability of particular classes of constant dimension codes ⋮ New constructions of Sidon spaces ⋮ The non-existence of block-transitive subspace designs ⋮ New infinite series of 2-designs over the binary and ternary field ⋮ Constructions of Sidon spaces and cyclic subspace codes ⋮ Construction of subspace codes through linkage ⋮ Completely regular codes in Johnson and Grassmann graphs with small covering radii ⋮ Large sets of \(t\)-designs over finite fields exist for all \(t\) ⋮ Common Complements of Linear Subspaces and the Sparseness of MRD Codes ⋮ Defining the \(q\)-analogue of a matroid ⋮ On \(q\)-Steiner systems from rank metric codes ⋮ Distance distributions of cyclic orbit codes ⋮ New constructions of large cyclic subspace codes and Sidon spaces ⋮ The minimum volume of subspace trades ⋮ Unnamed Item ⋮ On \(\alpha \)-points of \(q\)-analogs of the Fano plane ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ A quasidouble of the affine plane of order 4 and the solution of a problem on additive designs ⋮ Constructions of large cyclic constant dimension codes via Sidon spaces ⋮ Designs over finite fields by difference methods ⋮ Mosaics of combinatorial designs ⋮ Automorphism groups and isometries for cyclic orbit codes ⋮ Further constructions of large cyclic subspace codes via Sidon spaces ⋮ To the theory of \(q\)-ary Steiner and other-type trades ⋮ The order of the automorphism group of a binary \(q\)-analog of the Fano plane is at most two ⋮ Construction of transitive \(q\)-analogs of designs ⋮ Deterministic construction of compressed sensing matrices from constant dimension codes ⋮ Equitable 2-partitions of the Hamming graphs with the second eigenvalue ⋮ New lower bounds for partial k‐parallelisms ⋮ Graph decompositions in projective geometries ⋮ Subspace packings: constructions and bounds ⋮ Combinatorial designs, difference sets, and bent functions as perfect colorings of graphs and multigraphs ⋮ Galois geometries and coding theory ⋮ Constructions of new matroids and designs over \(\mathbb{F}_q\) ⋮ Large sets of \(t\)-designs over finite fields ⋮ New and updated semidefinite programming bounds for subspace codes ⋮ New 2-designs over finite fields from derived and residual designs ⋮ Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6 ⋮ Fano kaleidoscopes and their generalizations ⋮ 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 ⋮ Constructions of cyclic constant dimension codes ⋮ Residual \(q\)-Fano planes and related structures ⋮ A new approach for examining \(q\)-Steiner systems ⋮ Derived and residual subspace designs ⋮ Generalized vector space partitions ⋮ Binary Hamming codes and Boolean designs ⋮ \(q\)-analogs of \(t\)-wise balanced designs from Borel subgroups ⋮ Further constructions of cyclic subspace codes ⋮ On \(q\)-covering designs ⋮ An Assmus--Mattson Theorem for Rank Metric Codes ⋮ Bounds on the cardinality of subspace codes with non-maximum code distance ⋮ Orbit codes from forms on vector spaces over a finite field ⋮ Unnamed Item ⋮ Super-regular Steiner 2-designs ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications ⋮ A new mathematical model for tiling finite regions of the plane with polyominoes ⋮ Cyclic orbit codes and stabilizer subfields ⋮ A new family of additive designs

Uses Software

• libexact

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nontrivial \(t\)-designs over finite fields exist for all \(t\)
• Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
• Some new distance-4 constant weight codes
• Classification algorithms for codes and designs
• Designs over finite fields
• Designs and partial geometries over finite fields
• Linear groups containing a Singer cycle
• 2-designs over \(GF(q)\)
• Association schemes and t-designs in regular semilattices
• t-designs on hypergraphs
• A class of three-designs
• Parallelismen in unendlichen projektiven Räumen endlicher Dimension
• Codes and anticodes in the Grassman graph
• Counting designs
• Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
• q-analogues of t-designs and their existence
• Locally symmetric designs
• Remarks on Singer cyclic groups and their normalizers.
• Quotient sets and subset-subspace analogy
• Derived and residual subspace designs
• Covering of subspaces by subspaces
• Cyclotomy and difference families in elementary Abelian groups
• 2-designs over \(GF(2^ m)\)
• A Random Linear Network Coding Approach to Multicast
• Coding for Errors and Erasures in Random Network Coding
• Leonhard Euler and a 𝑞-analogue of the logarithm
• Maximal Subgroups of Symplectic Groups Stabilizing Spreads II
• Projective Geometry over  1 and the Gaussian Binomial Coefficients
• The t‐designs with prescribed automorphism group, new simple 6‐designs
• On a class of small 2‐designs over gf(q)
• Error-Correcting Codes in Projective Space
• Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
• On the Foundations of Combinatorial Theory IV Finite Vector Spaces and Eulerian Generating Functions
• On perfect codes and related concepts

This page was built for publication: EXISTENCE OF -ANALOGS OF STEINER SYSTEMS