Let A be a bipartite graph between two sets D and T. Then A defines by Hamming distance, metrics on both T and D. The question is studied which pairs of metric spaces can arise this way. If both spaces are trivial the matrix A comes from a Hadamard matrix or is a BIBD. The second question studied is in what ways A can be used to transfer (classification) information from one of the two sets to ...

A bstract. We give miscellaneous constructions for I-rotational (4q+l,5,?\)-BIBD's, being q an odd prime power, investigating their possible resolvability whenever q (mod 10). Concerning Steiner 2-designs, the strongest result that we obtain, is the explicit construction of a I-rotational (4q+l,5,1)-BIBD (with a multiplier of order 5) for each prime q == 1 (mod 30) such that (11 + 5-[5) /2 is n...

We introduce, for block size 3, the problem of minimal enclosings of GDDs with u groups of size g into GDDs with u groups of size g + 1. We prove the necessary conditions are sufficient for the embedding of any GDD with group size 1, i.e., a BIBD(v, 3, λ), into a GDD with v groups of size 2. Minimal faithful enclosings of GDDs are given for group size 2 with any index into GDDs with group size ...

We show that the necessary divisibility conditions for the existence of a σ-resolvable BIBD(v, k, λ) are sufficient for large v. The key idea is to form an auxiliary graph based on an [r, k]-configuration with r = σ, and then edge-decompose the complete λ-fold graph K (λ) v into this graph. As a consequence, we initiate a similar existence theory for incomplete designs with index λ. ∗ Supported...

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 other constructions, such as superimposed codes and perfect hash families etc. The existence of super-simple (v, 4, λ)-BIBDs have been determined for λ = 2, 3, 4 and 6. When λ = 5, the necessary conditions of such a d...

This paper presents a novel approach for constructing structured regular QC-LDPC codes based on a special type of combinatorial designs,known as the balanced incomplete block design (BIBD).The code design approach based on the technology of block cyclic shift and dispertion (BCSD) for correcting erasure-bursts over the binary bursts erasure channel (BBEC). Furthermore, the Tanner graph of the c...

Let A be a bipartite graph between two sets D and T. Then A defines by Hamming distance, metrics on both T and D. The question is studied which pairs of metric spaces can arise this way. If both spaces are trivial the matrix A comes from a Hadamard matrix or is a BIBD. The second question studied is in what ways A can be used to transfer (classification) information from one of the two sets to ...

The Cochran–Mantel–Haenszel (CMH) tests apply when every treatment is present on block or stratum and responses are categorical. This chapter explains the most elementary of incomplete designs, balanced design (BIBD), in part to see how CMH methods can aid analysis for such designs. relationship shows that adjusted Durbin test ANOVA F essentially same test, so both equality mean ranks, not mere...

The influence of two yeast strains and the addition copper sulphate on aroma Riesling wines was monitored. Two commercially available strains, Zymaflore VL3 X-Pure, were applied. General composition, volatile thiols, norisoprenoids, free terpenes, fermentation, sulphur compounds content determined, sensory attributes assessed by 22 tasters in a balanced incomplete block design (BIBD). produced ...