Partitioning the planes of \(AG_{2m}(2)\) into 2-designs
From MaRDI portal
Publication:1225620
DOI10.1016/0012-365X(76)90025-XzbMath0326.05013OpenAlexW2046169812MaRDI QIDQ1225620
Publication date: 1976
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(76)90025-x
Related Items (60)
Construction of Uniform Designs and Complex-Structured Uniform Designs via Partitionable t-Designss ⋮ Isomorphism and Invariants of Parallelisms of Projective Spaces ⋮ Generalized Preparata codes and 2-resolvable Steiner quadruple systems ⋮ Orthogonal packings in PG(5,2) ⋮ New parallelisms of \(\operatorname{PG}(3,5)\) with automorphisms of order 8 ⋮ A construction for large sets of disjoint Kirkman triple systems ⋮ Special sets of lines in PG(3,2) ⋮ Construction of 3-designs using \((1,\sigma)\)-resolution ⋮ A method of constructing 2-resolvable \(t\)-designs for \(t=3,4\) ⋮ Purely tetrahedral quadruple systems ⋮ CORES OF SYMMETRIC GRAPHS ⋮ On transitive parallelisms of \(\mathrm{PG}(3,4)\) ⋮ 2-spreads and transitive and orthogonal 2-parallelisms of \(PG(5, 2)\) ⋮ Efficient two-stage group testing algorithms for genetic screening ⋮ Partitions of the lines in \(\mathrm{PG}( 2 n - 1, s)\) into multifold spreads for \(s = 3, 4\) ⋮ Groups synchronizing a transformation of non-uniform kernel ⋮ Large sets of resolvable idempotent Latin squares ⋮ The chromatic index of finite projective spaces ⋮ More results on large sets of Kirkman triple systems ⋮ A family of diameter perfect constant-weight codes from Steiner systems ⋮ Steiner systems for two-stage disjunctive testing ⋮ A new series of large sets of subspace designs over the binary field ⋮ Cores and independence numbers of Grassmann graphs ⋮ PIR codes from combinatorial structures ⋮ New lower bounds for partial k‐parallelisms ⋮ Graph decompositions in projective geometries ⋮ Subspace packings: constructions and bounds ⋮ Galois geometries and coding theory ⋮ Doubly resolvable Steiner quadruple systems of orders \(2^{2n+1}\) ⋮ Multicolor Ramsey numbers for triple systems ⋮ Large sets of \(t\)-designs over finite fields ⋮ Orthogonal quadruple systems and 3-frames ⋮ Projective spread sets ⋮ Zero-sum flows of the linear lattice. ⋮ Types of spreads and duality of the parallelisms of \(\mathrm{PG}(3,5)\) with automorphisms of order 13 ⋮ Optimal constant weight covering codes and nonuniform group divisible 3-designs with block size four ⋮ New parallelisms of \(\mathrm{PG}(3, 4)\) ⋮ A recursive construction for simple \(t\)-designs using resolutions ⋮ A new approach for examining \(q\)-Steiner systems ⋮ The Chromatic Index of Projective Triple Systems ⋮ Asymptotic Bounds for General Covering Designs ⋮ A decomposition of the 2-design formed by the planes in \(AG(2n, 3)\) ⋮ Steiner quadruple systems - a survey ⋮ Some New Infinite Classes of Candelabra Quadruple Systems ⋮ On line colorings of finite projective spaces ⋮ New Regular Parallelisms of PG(3, 5) ⋮ Existence of Steiner quadruple systems with a spanning block design ⋮ On simple 3-designs having 2-resolutions ⋮ Recursive constructions for skew resolutions in affine geometries ⋮ Uniformly resolvable three-wise balanced designs with block sizes four and six ⋮ Partial ‐Parallelisms in Finite Projective Spaces ⋮ Orthogonal line packings of \(PG_{2m-1}(2)\) ⋮ Recursive constructions for \(s\)-resolvable \(t\)-designs ⋮ A new existence proof for large sets of disjoint Steiner triple systems ⋮ On point-transitive and transitive deficiency one parallelisms of \(\mathrm{PG}(3,4)\) ⋮ Parallelisms of \(\mathrm{PG}(3,4)\) invariant under an elementary abelian group of order 4 ⋮ Further study on optimal data placements for triple replication ⋮ Some new 2-resolvable Steiner quadruple systems ⋮ Regular parallelisms from translation planes ⋮ Backtrack search for parallelisms of projective spaces
Cites Work
- On parallelisms in finite projective spaces
- Spreads and a conjecture of Bruck and Bose
- On resolvable designs
- The construction of translation planes from projective spaces
- An optimum nonlinear code
- A class of optimum nonlinear double-error-correcting codes
- New binary codes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Partitioning the planes of \(AG_{2m}(2)\) into 2-designs