Self-orthogonal codes constructed from orbit matrices of 2-designs and quotient matrices of divisible designs

In 2003 Harada and Tonchev showed a construction of self-orthogonal codes from orbit matrices of block designs with fixed-point-free automorphisms. We describe a construction of self-orthogonal codes from orbit matrices of 2-designs admitting certain automorphisms with fixed points (and blocks). Further, we present a construction of self-orthogonal codes from quotient matrices of divisible designs and divisible design graphs.     

A structural classification of SR group divisible designs

A simple method of construction of a semi-regular (SR) group divisible design from another SR group divisible design is given. Using this method, 111 available SR designs from Clatworthy (1973) and John and Turner (1977) are systematically classified into 20 classes. This procedure may produce new nonisomorphic solutions for known designs.     

A complete solution to the existence and nonexistence of Knut Vik designs and orthogonal Knut Vik designs

Hedayat and Federer (Ann. of Statist.3 (1975), 445–447) proved that Knut Vik designs do not exist for all even orders. They gave a simple algorithm for the construction of such designs for all other orders, except when the order of the design is divisible by 3. The existence of Knut Vik designs of orders divisible by 3 was left unsolved by these authors. It is shown here that Knut Vik designs do not also exist for all orders divisible by 3. An easy algorithm based on a result of Euler is provided for the construction of orthogonal Knut Vik designs for all orders not divisible by 2 or 3. Therefore, we can say that Knut Vik designs and orthogonal Knut Vik designs of order n exist if and only if n is not divisible by 2 or 3. The results are based on the concepts of a super diagonal and parallel super diagonals in an n × n array, which have been introduced and studied for the first time here. Other relevant results are also given.     

General Constructions for Double Group Divisible Designs and Double Frames

We generalize the concept of an incomplete double group divisible design and describe some recursive constructions for such a generalized new design. As a consequence, we obtain a general recursive construction for group divisible designs, which unifies many important recursive constructions for various types of combinatorial designs. We also introduce the concept of a double frame. After providing a preliminary result on the number of partial resolution classes, we describe a general construction for double frames. This construction method can unify many known recursive constructions for frames.     

Divisible designs and semi-regular relative difference sets from additive Hadamard cocycles

Additive Hadamard cocycles are a natural generalization of presemifields. In this paper, we study divisible designs and semi-regular relative difference sets obtained from additive Hadamard cocycles. We show that the designs obtained from additive Hadamard cocycles are flag transitive. We introduce a new product construction of Hadamard cocycles. We also study additive Hadamard cocycles whose divisible designs admit a polarity in which all points are absolute. Our main results include generalizations of a theorem of Albert and a theorem of Hiramine from presemifields to additive Hadamard cocycles. At the end, we generalize Maiorana-McFarland?s construction of bent functions to additive Hadamard cocycles.     

Linked systems of symmetric group divisible designs

We introduce the concept of linked systems of symmetric group divisible designs. The connection with association schemes is established, and as a consequence we obtain an upper bound on the number of symmetric group divisible designs which are linked. Several examples of linked systems of symmetric group divisible designs are provided.     

区组大小为 4 的二重超单可分解的可分组设计

自 1992 年 Gronau 和 Mullin 提出超单设计的概念以来, 很多研究者参与了超单设计的研究. 超单设计在编码等方面也有广泛的应用. 超单可分组设计是超单设计的重要组成部分. 本文我们主要研究区组大小为4 的二重超单可分解的可分组设计, 并基本解决了此类设计的存在性问题.     

A Construction for Resolvable Designs and Its Generalizations

 In [14], D.K. Ray-Chaudhuri and R.M. Wilson developed a construction for resolvable designs, making use of free difference families in finite fields, to prove the asymptotic existence of resolvable designs with index unity. In this paper, generalizations of this construction are discussed. First, these generalizations, some of which require free difference families over rings in which there are some units such that their differences are still units, are used to construct frames, resolvable designs and resolvable (modified) group divisible designs with index not less than one. Secondly, this construction method is applied to resolvable perfect Mendelsohn designs. Thirdly, cardinalities of such sets of units are investigated. Finally, composition theorems for free difference families via difference matrices are described. They can be utilized to produce some new examples of resolvable designs.     

A construction of group divisible designs with block sizes 3 to 7

This paper gives a construction of group divisible designs (GDDs) on the binary extension fields with block sizes 3, 4, 5, 6, and 7, respectively, which consist of the error patterns whose first syndromes are zeros recognized from the decoding of binary quadratic residue codes. A conjecture is proposed for this construction of GDDs with larger block sizes.     

Partitioning Quadrics, Symmetric Group Divisible Designs and Caps

Using partitionings of quadrics we give a geometric construction of certain symmetric group divisible designs. It is shown that some of them at least are self-dual. The designs that we construct here relate to interesting work — some of it very recent — by D. Jungnickel and by E. Moorhouse. In this paper we also give a short proof of an old result of G. Pellegrino concerning the maximum size of a cap in AG(4,3) and its structure. Semi-biplanes make their appearance as part of our construction in the three dimensional case.     

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.     

Asymptotic existence theorems for frames and group divisible designs

In this paper, we establish an asymptotic existence theorem for group divisible designs of type mn with block sizes in any given set K of integers greater than 1. As consequences, we will prove an asymptotic existence theorem for frames and derive a partial asymptotic existence theorem for resolvable group divisible designs.     

Near-symmetric divisible designs

We construct some classes of -near-symmetric divisible designs by permutation group methods. We also define and study Paley divisible designs which generalize the well-known class of Paley 2-designs.Dedicated to professor Giuseppe Tallini     

Divisible design graphs

A divisible design graph is a graph whose adjacency matrix is the incidence matrix of a divisible design. Divisible design graphs are a natural generalization of (v,k,λ)-graphs, and like (v,k,λ)-graphs they make a link between combinatorial design theory and algebraic graph theory. The study of divisible design graphs benefits from, and contributes to, both parts. Using information of the eigenvalues of the adjacency matrix, we obtain necessary conditions for existence. Old results of Bose and Connor on symmetric divisible designs give other conditions and information on the structure. Many constructions are given using various combinatorial structures, such as (v,k,λ)-graphs, distance-regular graphs, symmetric divisible designs, Hadamard matrices, and symmetric balanced generalized weighing matrices. Several divisible design graphs are characterized in terms of the parameters.     

Divisible designs with dual translation group

Many different divisible designs are already known. Some of them possess remarkable automorphism groups, so called dual translation groups. The existence of such an automorphism group enables us to characterize its associated divisible design as being isomorphic to a substructure of a finite affine space.      

On circular designs

Summary A general method of analysis of circular designs (Das [3]) is suggested. Average efficiency factors of these designs have been tabulated.A-optimality of circular designs has been studied in comparison to group divisible incomplete block designs.     

Composite construction of group divisible designs

Two new methods of constructing group divisible designs are given. In particular, a new resolvable solution for the SR 39 is presented.     

Large sets with holes

We study large sets of disjoint Steiner triple systems “with holes”. The purpose of these structures is to extend the use of large sets of disjoint Steiner triple systems in the construction of various other large set type structures to values of v for which no Steiner triple system of order v exists, i.e., v ≡ 0, 2, 4, or 5 (mod 6). We give constructions for all of these congruence classes. We describe several applications, including applications to large sets of disjoint group divisible designs and to large sets of disjoint separable ordered designs. © 1993 John Wiley & Sons, Inc.     

Constructions of Group Divisible Designs

In this paper we present constructions for group divisible designs from generalized partial difference matrices. We describe some classes of examples.     

Divisible Designs Admitting GL(3, q) as an Automorphism Group

Starting from a 3-dimensional projective space we construct divisible designs admitting GL(3,q) as an automorphism group.