Intersection Numbers For Subspace Designs
From MaRDI portal
Publication:5744158
DOI10.1002/jcd.21403zbMath1331.05049arXiv1405.6110OpenAlexW1949087419MaRDI QIDQ5744158
Michael Kiermaier, Mario-Osvin Pavčević
Publication date: 17 February 2016
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.6110
Related Items
On the extendability of particular classes of constant dimension codes, On \(\alpha \)-points of \(q\)-analogs of the Fano plane, Weighted subspace designs from \(q\)-polymatroids, Higher incidence matrices and tactical decomposition matrices, The order of the automorphism group of a binary \(q\)-analog of the Fano plane is at most two, Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods, Dual incidences and t‐designs in vector spaces, Galois geometries and coding theory, Constructions of new matroids and designs over \(\mathbb{F}_q\), New and updated semidefinite programming bounds for subspace codes, Large sets of subspace designs, A new approach for examining \(q\)-Steiner systems, Derived and residual subspace designs, Generalized vector space partitions, An Assmus--Mattson Theorem for Rank Metric Codes
Cites Work
- Unnamed Item
- Nontrivial \(t\)-designs over finite fields exist for all \(t\)
- Designs over finite fields
- Über einen Satz von Köhler. (A theorem of Köhler)
- 2-designs over \(GF(q)\)
- Non-existence d'un 3-design de paramètres \(\lambda=2\), \(k=5\) et \(v=11\)
- On t-designs
- Association schemes and t-designs in regular semilattices
- High order intersection numbers of \(t\)-designs
- Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
- On the inequalities of \(t\)-designs over a finite field
- Allgemeine Schnittzahlen in t-Designs. (General intersection numbers in t-designs)
- q-analogues of t-designs and their existence
- 't-designs' in H(d,q)
- Congruence properties of ordinary and q-binomial coefficients
- Gaussian binomial coefficients
- 2-designs over \(GF(2^ m)\)
- Projective Geometry over 1 and the Gaussian Binomial Coefficients
- On the Foundations of Combinatorial Theory IV Finite Vector Spaces and Eulerian Generating Functions
