In statistical planning of experiments, super-simple designs are the ones providing samples
with maximum intersection as small as possible. Super-simple designs are also useful in …

Super-simple designs are useful in constructing codes and designs such as superimposed
codes and perfect hash families. Recently, Gronau et al. determined the existence of super …

Super-simple designs are useful in constructing codes and designs such as superimposed
codes and perfect hash families. In this article, we investigate the existence of a super …

A design is said to be super-simple if the intersection of any two blocks has at most two
elements. A design with index λ is said to be {λ 1 s 1, λ 2 s 2,…, λ rsr}-decomposable, with∑ …

Decomposable designs are important combinatorial designs, and have applications in
constant weight codes, perfect threshold schemes and graph decompositions. Let λ λ be an …

In statistical planning of experiments, super-simple designs are the ones providing samples
with maximum intersection as small as possible. Super-simple designs are also useful in …

Super-simple designs are used in other constructions, such as coverings, superimposed
codes and perfect hash families etc. The existence of super-simple (v, 4, λ)-BIBDs has been …

A design is said to be super-simple if the intersection of any two blocks has at most two
elements. In statistical planning of experiments, super-simple designs provide samples with …

Super-simple designs are useful in constructing codes and designs such as superimposed
codes and perfect hash families. In this article, we investigate the existence of a super …

The necessary conditions for the existence of a super‐simple resolvable balanced
incomplete block design on v points with block size k= 4 and index λ= 2, are that v≥ 16 and …