AbstractUsing matrix theoretic methods, bounds are obtained on the number of replications in certain combinatorial designs, some of which generalize previous results for multiplicative designs and λ-designs
AbstractIn this paper we study combinatorial designs that are characterized by a (0, 1)-matrix A of ...
AbstractA λ-design is a family B1, B2, …, Bv of subsets of X = {1, 2, …, v} such that |Bi ∩ Bj| = λ ...
AbstractWe secure inequalities on submatrices of N′N, where N is the incidence matrix of certain des...
AbstractUsing matrix theoretic methods, bounds are obtained on the number of replications in certain...
This thesis deals with two problems. The first is the determination of λ-designs, combinatorial conf...
AbstractIn the theory of communication, both coding and cryptology play an important role. They are ...
AbstractWe continue the study of multiplicative designs concentrating primarily on uniform, normal d...
AbstractIt is proven that a λ-design D is type 1 iff every pair of treatments with different replica...
In this and an earlier paper [17] we study combinatorial designs whose incidence matrix has two dist...
Let forb(m, F) denote the maximum number of columns possible in a (0, 1)-matrix A that has no repeat...
AbstractIn this paper we investigate block designs with repeated blocks and parameters υ, k; b, r, λ...
AbstractThis paper investigates the structure of block designs with repeated blocks. Let the block d...
AbstractIn this and an earlier paper [E.R. van Dam, E. Spence, Combinatorial designs with two singul...
In this and an earlier paper [17] we study combinatorial designs whose incidence matrix has two dist...
AbstractIn this and an earlier paper [E.R. van Dam, E. Spence, Combinatorial designs with two singul...
AbstractIn this paper we study combinatorial designs that are characterized by a (0, 1)-matrix A of ...
AbstractA λ-design is a family B1, B2, …, Bv of subsets of X = {1, 2, …, v} such that |Bi ∩ Bj| = λ ...
AbstractWe secure inequalities on submatrices of N′N, where N is the incidence matrix of certain des...
AbstractUsing matrix theoretic methods, bounds are obtained on the number of replications in certain...
This thesis deals with two problems. The first is the determination of λ-designs, combinatorial conf...
AbstractIn the theory of communication, both coding and cryptology play an important role. They are ...
AbstractWe continue the study of multiplicative designs concentrating primarily on uniform, normal d...
AbstractIt is proven that a λ-design D is type 1 iff every pair of treatments with different replica...
In this and an earlier paper [17] we study combinatorial designs whose incidence matrix has two dist...
Let forb(m, F) denote the maximum number of columns possible in a (0, 1)-matrix A that has no repeat...
AbstractIn this paper we investigate block designs with repeated blocks and parameters υ, k; b, r, λ...
AbstractThis paper investigates the structure of block designs with repeated blocks. Let the block d...
AbstractIn this and an earlier paper [E.R. van Dam, E. Spence, Combinatorial designs with two singul...
In this and an earlier paper [17] we study combinatorial designs whose incidence matrix has two dist...
AbstractIn this and an earlier paper [E.R. van Dam, E. Spence, Combinatorial designs with two singul...
AbstractIn this paper we study combinatorial designs that are characterized by a (0, 1)-matrix A of ...
AbstractA λ-design is a family B1, B2, …, Bv of subsets of X = {1, 2, …, v} such that |Bi ∩ Bj| = λ ...
AbstractWe secure inequalities on submatrices of N′N, where N is the incidence matrix of certain des...
DOI
Add to ORKG