The Existence and Construction of Balanced Incomplete Block Designs
From MaRDI portal
Publication:3294602
DOI10.1214/aoms/1177705047zbMath0107.36102WikidataQ106884305 ScholiaQ106884305MaRDI QIDQ3294602
Publication date: 1961
Published in: The Annals of Mathematical Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoms/1177705047
Related Items
Self-orthogonal latin squares of all orders 𝑛≠2,3,6, Existence Theorems for Matroid Designs, Optimality and construction of nested row and column designs, Balanced ternary designs with block size four, The completely symmetric designs with blocksize three, Cyclic Mendelsohn triple systems with a cyclic resolution or a cyclic almost resolution, A note on reverse Steiner triple systems, Existence and constructions of 2-designs S\(_3\)(2,3,v) without repeated blocks, Tripelsysteme mit Untersystemen, Certain recurrent and asymptotic estimates in the covering problem, Four pairwise balanced designs, An existence theory for pairwise balanced designs. III: Proof of the existence conjectures, Twofold triple systems and graph imbeddings, On resolvable balanced incomplete block designs, Another class of balanced graph designs: Balanced circuit designs, Tactical constructions, Zur Theorie der Steinersysteme, A lower bound for v in a \(t-(v,k,\lambda)\) design, Balanced bipartite weighing designs, Some imbedding theorems for block designs balanced with respect to pairs, Constructing block designs of elements or residue rings with a composite modulus, Balanced incomplete block designs and related designs, On the conjugates of an \(n\times 4\) orthogonal array, Construction of skew room squares, \(G\)-decomposition of \(K_n\), where G has four vertices or less, Matroid Designs of Prime Power Index, Theory of division games, A recursive method of construction of resolvable BIB-designs, Optimal packings of \(K_4\)'s into a \(K_n\), Group divisible designs with two associate classes: \(n=2\) or \(m=2\), On conjectures of Berge and Chvátal, The fundamental construction for 3-designs, Some new 2-resolvable Steiner quadruple systems, Generalised Bhaskar Rao designs over non-Abelian groups, Linear spaces with many small lines, Non-isomorphic solutions of group divisible designs with \(k=3\) and \(\lambda_ 1=0\), On the existence of 2-designs S\(_2\)(2,3,v) without repeated blocks, On the E-optimality of a certain class of block designs., Optimal design in irregular BIBD settings, Blocking sets in designs with block size 4, A direct method to construct triple systems, Block designs with repeated blocks and \((b,r,\lambda)=1\), On the construction of perfect deletion-correcting codes using design theory, On the existence of super-simple designs with block size 4, Robust procedures in multiple regression: \(p\)-subsets and a computational proposal, On the covering of pairs by quadruples. I, Experimental designs through level reduction of the d-dimensional cuboctahedron, On balanced incomplete block designs with blocks having five elements, Block designs with repeated blocks, Simple constructions for balanced incomplete block designs with block size three, Cyclotomy and difference families in elementary Abelian groups, On the covering of pairs by quadruples. II, An existence theory for pairwise balanced designs. I: Composition theorems and morphisms, An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures, On resolvable designs, Embeddings of Steiner triple systems, Improved bounds for group testing designs, Location of outliers in multiple regression using resampled values, Enumeration of small nonisomorphic 1-rotational twofold triple systems, Stein quasigroups I: Combinatorial aspects, An infinite class of PBIB designs
