The existence of \(2^3\)-decomposable super-simple \((v,4,6)\)-BIBDs

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Uniformly resolvable decompositions of \(K_v\) into \(K_2\) and \(K_{1, 3}\) graphs
Completely reducible super-simple designs with block size five and index two
Super-simple \((v,5,4)\) designs
Super-simple group divisible designs with block size 4 and index 2
Super-simple balanced incomplete block designs with block size 4 and index 5
Balanced incomplete block designs and related designs
Super-simple (\(v\),\,5,\,2)-designs.
Super-simple balanced incomplete block designs with block size 4 and index 6
On the existence of super-simple designs with block size 4
On the existence of super-simple \((v,4,4)\)-BIBDs
Super-simple BIBDs with block size 4 and index 7
Super-simple balanced incomplete block designs with block size 4 and index 9
Completely reducible super-simple designs with block size four and related super-simple packings
Super-simple balanced incomplete block designs with block size 5 and index 3
Super-simple Steiner pentagon systems
Super-simple \((\nu, 5, 5)\) designs
\(4^2\)-decomposable super-simple \((v,4,8)\)-BIBDs
New upper bounds on the minimum size of covering designs
On optimal superimposed codes
Decomposable super‐simple NRBIBDs with block size 4 and index 6
A combinatorial construction for perfect threshold schemes
Decomposable super‐simple RBIBDs with block size 4 and index 6
Optimal Ternary Constant-Weight Codes of Weight Four and Distance Six
Super-simple designs with \(v\leq 32\)

This page was built for publication: The existence of \(2^3\)-decomposable super-simple \((v,4,6)\)-BIBDs