A Construction of Optimal Constant Composition Codes

In this paper, a construction of optimal constant composition codes is developed, and used to derive some series of new optimal constant composition codes meeting the upper bound given by [13].     

Embeddings of resolvable group divisible designs with block size 3

It is proved in this paper that an RGD(3, g;v) can be embedded in an RGD(3, g;u) if and only if , , , v ≥ 3g, u ≥ 3v, and (g,v) ≠ (2,6),(2,12),(6,18).     

On Resolvable Multipartite G-Designs II

In this paper, it has been proved that and are factorable, where ⊗ denotes wreath product of graphs. As a consequence, a resolvable (k,n,k,2λ) multipartite –design exists for even k. These results generalize the results of Ushio on –factorizations of complete tripartite graphs.     

Existence of incomplete canonical Kirkman packing designs

For $u,v$ positive integers with $u\equiv v\equiv 4\left(mod6\right)$, let ICKPD$(u,v)$ denote a canonical Kirkman packing of order $u$ missing one of order $v$. In this paper, it is shown that the necessary condition for existence of an ICKPD$(u,v)$, namely $u\ge 3v+4$, is sufficient with a definite exception $(u,v)=(16,4)$, and except possibly when $v>76$, $v\equiv 4\left(mod12\right)$ and $u\in \{3v+4,3v+10\}$.     

Minimum embedding of Steiner triple systems into -designs I

A (K₄-e)-design on v+w points embeds a Steiner triple system (STS) if there is a subset of v points on which the graphs of the design induce the blocks of a STS. It is established that wv/3, and that when equality is met that such a minimum embedding of an STS(v) exists, except when v=15.     

Group divisible designs with block size four and two groups

We give some constructions of new infinite families of group divisible designs, GDD(n,2,4;λ₁,λ₂), including one which uses the existence of Bhaskar Rao designs. We show the necessary conditions are sufficient for 3?n?8. For n=10 there is one missing critical design. If λ₁>λ₂, then the necessary conditions are sufficient for . For each of n=10,15,16,17,18,19, and 20 we indicate a small minimal set of critical designs which, if they exist, would allow construction of all possible designs for that n. The indices of each of these designs are also among those critical indices for every n in the same congruence class mod 12.     

Existence of (2, 8) GWhD( v) and (4, 8) GWhD( v) with $${ v \equi v 0,1 (mod 8)}$$

(2, 8) Generalized Whist tournament Designs (GWhD) on v players exist only if . We establish that these necessary conditions are sufficient for all but a relatively small number of (possibly) exceptional cases. For there are at most 12 possible exceptions: {177, 249, 305, 377, 385, 465, 473, 489, 497, 537, 553, 897}. For there are at most 98 possible exceptions the largest of which is v = 3696. The materials in this paper also enable us to obtain four previously unknown (4, 8)GWhD(8n+1), namely for n = 16,60,191,192 and to reduce the list of unknown (4, 8) GWhD(8n) to 124 values of v the largest of which is v = 3696.      

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.     

Miscellaneous classification results for 2-designs

An orderly algorithm combined with clique searching is used to show that there are—up to isomorphism, in all cases—325,062 resolvable 2-(16,4,2) designs with 339,592 resolutions, 19,072,802 2-(13,6,5) designs, and 15,111,019 2-(14,7,6) designs. Properties of the classified designs are further discussed.     

Resolvable Balanced Incomplete Block Designs with Block Size 8

The necessary condition for the existence of a resolvable balanced incomplete block design on v points, with = 1 and k = 8, is that v 8 mod 56. With the exception of 66 values of v, this condition is shown to be sufficient. The largest exceptional value of v is 24480.