A powerful method for constructing difference families and optimal optical orthogonal codes

In this paper we proceed in the way indicated by R. M. Wilson for obtaining simple difference families from finite fields [28]. We present a theorem which includes as corollaries all the known direct techniques based on Galois fields, and provides a very effective method for constructing a lot of new difference families and also new optimal optical orthogonal codes.By means of our construction—just to give an idea of its power—it has been established that the only primesp<105 for which the existence of a cyclicS(2, 9,p) design is undecided are 433 and 1009. Moreover we have considerably improved the lower bound on the minimumv for which anS(2, 15,v) design exists.

[1]  M. Buratti.  Improving two theorems of bose on difference families , 1995 .

[2]  Rudolf Mathon,et al.  Constructions for Cyclic Steiner 2-designs , 1987 .

[3]  K. T. Phelps.  Isomorphism Problems for Cyclic Block Designs , 1987 .

[4]  Marco Buratti,et al.  Constructions of (q, k, 1) difference families with q a prime power and k = 4, 5 , 1995, Discret. Math..

[5]  D. R. Hughes.  Design Theory , 1985 .

[6]  Dieter Jungnickel,et al.  Composition theorems for difference families and regular planes , 1978, Discret. Math..

[7]  Richard M. Wilson,et al.  An Existence Theory for Pairwise Balanced Designs I. Composition Theorems and Morphisms , 1972, J. Comb. Theory, Ser. A.

[8]  Emma Lehmer,et al.  On Residue Difference Sets , 1953, Canadian Journal of Mathematics.

[9]  Richard M. Wilson,et al.  An Existence Theory for Pairwise Balanced Designs II. The Structure of PBD-Closed Sets and the Existence Conjectures , 1972, J. Comb. Theory, Ser. A.

[10]  Haim Hanani,et al.  Balanced incomplete block designs and related designs , 1975, Discret. Math..

[11]  Richard M. Wilson,et al.  Cyclotomy and difference families in elementary abelian groups , 1972 .

[12]  C. Colbourn,et al.  Recursive constructions for cyclic block designs , 1984 .

[13]  Tuvi Etzion,et al.  The last packing number of quadruples, and cyclic SQS , 1993, Des. Codes Cryptogr..

[14]  M.J Grannell,et al.  Product constructions for cyclic block designs II. Steiner 2-designs , 1986, J. Comb. Theory, Ser. A.

[15]  Mike J. Grannell,et al.  Product Constructions for Cyclic Block Designs. I. Steiner Quadruple Systems , 1984, J. Comb. Theory, Ser. A.

[16]  Peter J. Cameron,et al.  Graphs, codes, and designs , 1980 .

[17]  Hanfried Lenz,et al.  Design theory , 1985 .

[18]  M. Colbourn,et al.  On Cyclic Steiner 2-Designs , 1980 .

[19]  Marshall Hall,et al.  Codes and Designs , 1981, J. Comb. Theory, Ser. A.

[20]  Fan Chung Graham,et al.  Optical orthogonal codes: Design, analysis, and applications , 1989, IEEE Trans. Inf. Theory.

[21]  P. Vijay Kumar,et al.  Optical orthogonal codes-New bounds and an optimal construction , 1990, IEEE Trans. Inf. Theory.

[22]  Richard M. Wilson,et al.  An Existence Theory for Pairwise Balanced Designs, III: Proof of the Existence Conjectures , 1975, J. Comb. Theory, Ser. A.

[23]  M. Buratti.  On simple radical difference families , 1995 .

[24]  Tuvi Etzion,et al.  Constructions for optimal constant weight cyclically permutable codes and difference families , 1995, IEEE Trans. Inf. Theory.

[25]  Steven Furino,et al.  Difference families from rings , 1991, Discret. Math..

[26]  Masakazu Jimbo,et al.  On a composition of cyclic 2-designs , 1983, Discret. Math..

[27]  R. C. Bose.  ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS , 1939 .