Some New 5-Designs

DOI10.1112/BLMS/8.3.263MaRDI QIDQ4106220zbMATH OpenOpenAlexFDO

Authors Ralph Hugh Francis Denniston

Publication date 1976

Published in Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/blms/8.3.263

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30) Statistical block designs (62K10)

Cited in

(22)

• \(t\)-wise balanced designs
• Zur Vervollständigung von Dreiecksräumen. (Completing triangle spaces)
• The family of t-designs. Part I
• t-designs from the large Mathieu groups
• A class of three-designs
• Some existence theorems for \(t\)-designs
• A Steiner system \(S(5,6,108)\)
• A recursive construction for simple \(t\)-designs using resolutions
• On the construction of authentication and secrecy codes
• Decomposition of the complete hypergraph into hyperclaws
• The family of t-designs. II
• On three-designs of small order
• Simple 3-designs and PSL\((2,q )\) with \(q \equiv 1\pmod4\)
• Simple \(8\)-\((31,12,3080)\), \(8\)-\((40,12,16200)\) and \(8\)-\((40,12,16520)\) designs from \(\mathrm{PSL}(3,5)\) and \(\mathrm{PSL}(4,3)\)
• Some rigid Steiner 5-designs
• Some Properties of Steiner Systems S(2, 4, v) and S(3, 5, v) Having Transversals
• New coverings oft-sets with (t + 1)-sets
• Steiner systems 𝑆(5,6,𝑣) with 𝑣=72 and 84
• Simple \(t\)-designs: a recursive construction for arbitrary \(t\)
• Retracted article: ``Constructions for \(t\)-designs and \(s\)-resolvable \(t\)-designs
• A construction for authentication/secrecy codes from 3-homogeneous permutation groups
• The Steiner systems S(2,4,25) with nontrivial automorphism group

This page was built for publication: Some New 5-Designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4106220)