Enumeration of Symmetric Designs (25,9,3)

DOI10.1016/S0304-0208(08)73258-4zbMath0488.05011OpenAlexW9575871MaRDI QIDQ3949063

Ralph Hugh Francis Denniston

Publication date: 1982

Published in: North-Holland Mathematics Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-0208(08)73258-4

zbMATH Keywords

self-dual designsenumeration of symmetric designsself-polar designs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Related Items

Relative \(t\)-designs in binary Hamming association scheme \(H(n,2)\) ⋮ Switching for 2-designs ⋮ On Symmetric Designs and Binary 3-Frameproof Codes ⋮ Factorizations of symmetric designs ⋮ On symmetric BIBDs with the same 3-concurrence ⋮ Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem ⋮ On independent star sets in finite graphs ⋮ Switching codes and designs ⋮ On the enumeration of some D-optimal designs ⋮ A complete classification of symmetric (31, 10, 3) designs ⋮ Nonregular graphs with three eigenvalues ⋮ Existence of simple BIBDs from a prime power difference family with minimum index ⋮ A new family of BIBDs and non-embeddable (16,24,9,6,3)-designs ⋮ Three-class association schemes