Some new 2-resolvable Steiner quadruple systems

DOI10.1007/BF01388556zbMath0795.05020OpenAlexW2055709833MaRDI QIDQ1321552

Luc Teirlinck

Publication date: 11 September 1994

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01388556

zbMATH Keywords

Steiner systemsBIB design2-resolvable2-resolvable Steiner quadruple systems

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Steiner systems in finite geometry (51E10)

Related Items (35)

Construction of Uniform Designs and Complex-Structured Uniform Designs via Partitionable t-Designss ⋮ Generalized Preparata codes and 2-resolvable Steiner quadruple systems ⋮ New results on LR-designs and OLKTSs ⋮ A construction for large sets of disjoint Kirkman triple systems ⋮ Constructions for large sets of \(L\)-intersecting Steiner triple systems ⋮ A method of constructing 2-resolvable \(t\)-designs for \(t=3,4\) ⋮ Efficient two-stage group testing algorithms for genetic screening ⋮ Constructions for large sets of \(v-1\{0,{v\over 3}\}\)-intersecting Steiner triple systems of order \(v\) ⋮ Existence of frame-derived H-designs ⋮ Large sets of resolvable idempotent Latin squares ⋮ A new result on Sylvester's problem ⋮ A family of diameter perfect constant-weight codes from Steiner systems ⋮ Steiner systems for two-stage disjunctive testing ⋮ Doubly resolvable Steiner quadruple systems of orders \(2^{2n+1}\) ⋮ Orthogonal quadruple systems and 3-frames ⋮ Optimal ternary constant-composition codes with weight four and distance three ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ A completion of \(LS(2^n4^1)\) ⋮ A recursive construction for simple \(t\)-designs using resolutions ⋮ Large sets of disjoint pure Mendelsohn triple systems ⋮ Super-simple designs with \(v\leq 32\) ⋮ Asymptotic Bounds for General Covering Designs ⋮ Large sets of disjoint packings on \(6k+5\) points ⋮ On overlarge sets of Kirkman triple systems ⋮ Large sets of Kirkman triple systems of orders \(2^{2 n + 1} + 1\) ⋮ Partition of triples of order \(6 k +5\) into \(6 k +3\) optimal packings and one packing of size \(8 k +4\) ⋮ An improvement on H design ⋮ Some New Infinite Classes of Candelabra Quadruple Systems ⋮ The Existence of Well-Balanced Triple Systems ⋮ A tripling construction for overlarge sets of KTS ⋮ Existence of Steiner quadruple systems with a spanning block design ⋮ Further results on overlarge sets of Kirkman triple systems ⋮ On simple 3-designs having 2-resolutions ⋮ Recursive constructions for \(s\)-resolvable \(t\)-designs ⋮ A new existence proof for large sets of disjoint Steiner triple systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning the planes of \(AG_{2m}(2)\) into 2-designs
• On Quadruple Systems
• The Existence and Construction of Balanced Incomplete Block Designs
• A Generalization of a Theorem due to MacNeish
• Orthogonal Arrays of Index Unity

This page was built for publication: Some new 2-resolvable Steiner quadruple systems