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