Super‐simple resolvable balanced incomplete block designs with block size 4 and index 3

The necessary conditions for the existence of a super‐simple resolvable balanced incomplete block design on v points with k = 4 and λ = 3, are that v ≥ 8 and v ≡ 0 mod 4. These conditions are shown to be sufficient except for v = 12. © 2003 Wiley Periodicals, Inc.     

Super‐simple resolvable balanced incomplete block designs with block size 4 and index 2

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 . These conditions are shown to be sufficient. © 2006 Wiley Periodicals, Inc. J Combin Designs 15: 341–356, 2007     

Some results on resolvable incomplete block designs

This paper is concerned with the uniformity of a certain kind of resolvable incomplete block (RIB for simplicity) design which is called the PRIB design here. A sufficient and necessary condition is obtained, under which a PRIB design is the most uniform in the sense of a discrete discrepancy measure, and the uniform PRIB design is shown to be connected. A construction method for such designs via a kind of U-type designs is proposed, and an existence result of these designs is given. This method sets up an important bridge between PRIB designs and U-type designs.     

Pairwise and variance balanced incomplete block designs

Summary The purpose of this paper is three-fold. The first purpose is to compile and to systematize published and dispersed results on two aspects of balancing in incomplete block designs, i.e., pairwise balance and variance balance. This was done in order to establish the status of these two concepts of balance in published literature and to put them in a form which is useful for further work in this area. Also, the results in this form are necessary for the development of the remainder of the paper. The second purpose of this paper is to present a method of constructing unequal replicate and/or unequal block size experiment designs for which the variance balance property is achieved. The method of construction involves the union of blocks from two or more block designs and the augmentation of some of the blocks with additional treatments; the method is denoted asunionizing block designs. A straight-forward extension of the method would produce a partially balanced block design with unequal replicate and/or unequal block designs. The enlargement of the concept and availability of variance blanced block designs to accommodate unequal replication and/or unequal block sizes is important to the researcher, the teacher, and the experimenter needing such designs. For example, an animal nutritionist or a psychologist is no longer required to have constant litter or family sizes for the blocks and may have unequal replication on the treatments for those treatments with insufficient material and still attain the goal of equal variances on all normalized treatment contracts. The third purpose of the paper is to apply the unionizing block designs method to construct a family of unequal replicate and unequal block size variance balanced designs. Some comments are given on the extension of the unionizing block designs method to construct other families of variance balanced or partially balanced block designs. This investigation was supported in part by PHS Research Grant No. R01-GM-05900 from General Medical Services.     

Improved inequalities for balanced incomplete block designs

It is known that there are some lower bounds for the number of blocks in a balanced incomplete block design (BIBD). Especially, Fisher's inequality b?v is well-known for a BIBD with parameters v, b, r, k and λ. Fisher's inequality can be improved upon if one puts additional restrictions on a BIBD. Artificial restrictions are infinite in number so is the number of new bounds. The condition of non-symmetry on the design discussed here is a very simple restriction. The main purpose of this paper is to give improvements of inequalities for BIBDs with the only condition of non-symmetry. Improved inequalities appear to be the best for any non-symmetrical BIBD.     

More balanced incomplete block designs from frobenius groups

From a Frobenius group G = N ×_σ Φ with kernel N and complement Φ, one can sometimes construct new balanced incomplete block designs by taking as blocks the translations in N of blocks made from the union of the nontrivial orbits of Φ of a and −a in N together with the trivial orbit {0}.     

High-rate LDPC codes from partially balanced incomplete block designs

Journal of Algebraic Combinatorics - This paper presents a combinatorial construction of low-density parity-check (LDPC) codes from partially balanced incomplete block designs. Since...     

Resolvable balanced incomplete block designs with subdesigns of block size 4

In this paper, we look at resolvable balanced incomplete block designs on v points having blocks of size 4, briefly (v,4,1) RBIBDs. The problem we investigate is the existence of (v,4,1) RBIBDs containing a (w,4,1) RBIBD as a subdesign. We also require that each parallel class of the subdesign should be in a single parallel class of the containing design. Removing the subdesign gives an incomplete RBIBD, i.e., an IRB(v,w). The necessary conditions for the existence of an IRB(v,w) are that v?4w and . We show these conditions are sufficient with a finite number (179) of exceptions, and in particular whenever and whenever w?1852.We also give some results on pairwise balanced designs on v points containing (at least one) block of size w, i.e., a (v,{K,w^*},1)-PBD.If the list of permitted block sizes, K₅, contains all integers of size 5 or more, and v,w∈K₅, then a necessary condition on this PBD is v?4w+1. We show this condition is not sufficient for any w?5 and give the complete spectrum (in v) for 5?w?8, as well as showing the condition v?5w is sufficient with some definite exceptions for w=5 and 6, and some possible exceptions when w=15, namely 77?v?79. The existence of this PBD implies the existence of an IRB(12v+4,12w+4).If the list of permitted block sizes, K₁₍₄₎, contains all integers , and v,w∈K₁₍₄₎, then a necessary condition on this PBD is v?4w+1. We show this condition is sufficient with a finite number of possible exceptions, and in particular is sufficient when w?1037. The existence of this PBD implies the existence of an IRB(3v+1,3w+1).     

Partially balanced incomplete block designs from weakly divisible nearrings

In [[6] Riv. Mat. Univ. Parma 11 (2) (1970) 79-96] Ferrero demonstrates a connection between a restricted class of planar nearrings and balanced incomplete block designs. In this paper, bearing in mind the links between planar nearrings and weakly divisible nearrings (wd-nearrings), first we show the construction of a family of partially balanced incomplete block designs from a special class of wd-nearrings; consequently, we are able to give some formulas for calculating the design parameters.     

Super-simple balanced incomplete block designs with block size 4 and index 5

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 design are that and v≥13. In this paper, we show that there exists a super-simple (v,4,5)-BIBD for each and v≥13.     

Existence of resolvable optimal strong partially balanced designs

We shall refer to a strong partially balanced design SPBD(v,b,k;λ,0) whose b is the maximum number of blocks in all SPBD(v,b,k;λ,0), as an optimal strong partially balanced design, briefly OSPBD(v,k,λ). Resolvable strong partially balanced design was first formulated by Wang, Safavi-Naini and Pei [Combinatorial characterization of l-optimal authentication codes with arbitration, J. Combin. Math. Combin. Comput. 37 (2001) 205-224] in investigation of l-optimal authentication codes. This article investigates the existence of resolvable optimal strong partially balanced design ROSPBD(v,3,1). We show that there exists an ROSPBD(v,3,1) for any v?3 except v=6,12.     

Constructions for rotational near resolvable block designs

A (ν, k, k?1) near resolvable block design (NRBD) is r‐rotational over a group G if it admits G as an automorphism group of order (ν?1)/r fixing exactly one point and acting semiregularly on the others. We give direct and recursive constructions for rotational NRBDs with particular attention to 1‐rotational ones. © 2001 John Wiley & Sons, Inc. J Combin Designs 9: 157–181, 2001