Recursive constructions for 3-designs and resolvable 3-designs
From MaRDI portal
Publication:5954612
DOI10.1016/S0378-3758(00)00308-6zbMath0988.05022WikidataQ127100281 ScholiaQ127100281MaRDI QIDQ5954612
Publication date: 4 February 2002
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Related Items
Construction of 3-designs using \((1,\sigma)\)-resolution ⋮ Unifying some known infinite families of combinatorial 3-designs ⋮ Partially balanced t-designs ⋮ A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs ⋮ Construction of 3-designs using parallelism ⋮ A recursive construction for simple \(t\)-designs using resolutions ⋮ Simple \(t\)-designs: a recursive construction for arbitrary \(t\) ⋮ Steiner quadruple systems with point-regular abelian automorphism groups
Cites Work