论文信息 - Some techniques for constructing infinite families of BIBD'S

Some techniques for constructing infinite families of BIBD'S

Hadamard systems and balanced weighing systems, generalizing Hadamard matrices and balanced weighing matrices respectively, are defined and their properties are examined. Some of these systems are constructed and then used in constructing infinite families of BIBD's.

Dinesh P. Rajkundlia

[1] R. C. Bose,et al. On the construction of group divisible incomplete block designs , 1953 .

[2] Ian F. Blake,et al. The mathematical theory of coding , 1975 .

[3] Jennifer Seberry,et al. On the Existence of Hadamard Matrices , 1976, J. Comb. Theory, Ser. A.

[4] R. C. Bose,et al. Orthogonal Arrays of Strength two and three , 1952 .

[5] W. S. Connor,et al. Combinatorial Properties of Group Divisible Incomplete Block Designs , 1952 .

[6] Richard M. Wilson,et al. On resolvable designs , 1972, Discret. Math..

[7] K. Takeuchi,et al. A Table of Difference Sets Generating Balanced Incomplete Block Designs , 1962 .

[8] H. Hanani. On Transversal Designs , 1975 .

[9] Fred Piper,et al. Some Designs Which Admit Strong Tactical Decompositions , 1977, J. Comb. Theory, Ser. A.

[10] A. Street,et al. Combinatorics: room squares, sum-free sets, Hadamard matrices , 1972 .

[11] D. Raghavarao. Constructions and Combinatorial Problems in Design of Experiments , 1971 .

[12] R. Mullin,et al. A note on balanced weighing matrices , 1975 .