Abstract
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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Beth, T., Jungnickel, D., and Lenz, H. 1993.Design Theory. Cambridge University Press, Cambridge.
Bitan, S., and Etzion, T. 1993. The last packing number of quadruples and cyclic SQS.Designs, Codes and Cryptography 3(4):283–313.
Bitan, S., and Etzion, T. 1993. Constructions for optimal constant weight cyclically permutable codes and difference families. Submitted toIEEE Transactions of Information Theory.
Bose, R. C. 1939. On the construction of balanced incomplete block designs.Ann. Eugenics 9:353–399.
Brickell, E. F., and Wei, V. K. 1987. Optical orthogonal codes and cyclic block designs.Congressus Numerantium 58:175–192.
Buratti, M. 1993a. Problemi e risultati sulle famiglie differenza.Sem. Geom. Comb. Dip. Mat. Universitá di Roma “La Sapienza”, Quaderno n. 108.
Buratti, M. 1993b. Improving two theorems of Bose on difference families. To appear inJournal of Combinatorial Designs.
Buratti, M. 1993c. Constructions of (q, k, 1) difference families withq a prime power andk=4, 5. To appear in theProceedings of the 14th British Combinatorial Conference.
Buratti, M. 1993d. On simple radical difference families. To appear in theJournal of Combinatorial Designs.
Cameron, P. J., and Lint van, J. H. 1980.Graphs, Codes and Designs. London Math. Soc. Lecture Notes 43. Cambridge University Press, Cambridge.
Chung, H., and Kumar, P. V. 1990. Optical orthogonal codes—new bounds and an optimal construction.IEEE Transactions of Information Theory 36(4):866–872.
Chung, F. R. K., Salehi, J. A., and Wei, V. K. 1989. Optical orthogonal codes: design, analysis and applications.IEEE Transactions of Information Theory 35(3):595–604.
Colbourn, C. J., and Colbourn, M. J. 1984. Recursive constructions for cyclic block designs.J. Statist. Plann. Infer. 10:97–103.
Colbourn, M. J., and Mathon, R. 1980. On cyclic Steiner 2-designs.Ann. Discrete Math. 7:215–253.
Dembowski, P. 1968.Finite Geometries. Springer, Berlin-Heidelberg-New York.
Furino, S. 1991. Difference families from rings.Discrete Math. 97:177–190.
Grannell, M. J., and Griggs, T. S. 1984. Product constructions for cyclic block designs I. Steiner quadruple systems.J. Combin. Theory Ser. A 36:56–65.
Grannell, M. J., and Griggs, T. S. 1986. Product constructions for cyclic block designs II. Steiner 2-designs.J. Combin. Theory Ser. A 42:179–183.
Hall, M., Jr. 1986.Combinatorial Theory, 2nd ed. J. Wiley & Sons, New York.
Hanani, H. 1975. Balanced incomplete block designs and related designs.Discrete Math. 11:255–369.
Hughes, D. R., and Piper, F. C. 1988.Design Theory. Cambridge University Press, Cambridge.
Jimbo, M., and Kuriki, S. 1983. On a composition of cyclic 2-designs.Discrete Math. 46:249–255.
Jungnickel, D. 1978. Composition theorems for difference families and regular planes.Discrete Math. 23:151–158.
Lehmer, E. 1953. On residue difference sets.Canad. J. Math. 5:425–432.
Mathon, R. 1987. Constructions for cyclic Steiner 2-designs.Ann. Discrete Math. 34:353–362.
Phelps, K. T. 1987. Isomorphism problems for cyclic block designs.Ann. Discrete Math. 34:385–392.
Tallini, G. 1993. Composizioni di disegni.Sem. Geom. Comb. Dip. Mat. Universitá di Roma “La Sapienza”, Quaderno n. 109.
Wilson, R. M. 1972a. Cyclotomy and difference families in elementary abelian groups.J. Number Theory 4:17–42.
Wilson, R. M. 1972b. An existence theory for pairwise balanced designs I. Composition theorems and morphisms.J. Combin. Theory Ser. A 13:220–245.
Wilson, R. M. 1972c. An existence theory for pairwise balanced designs II. The structure of PBD-closed sets and the existence conjectures.J. Combin. Theory Ser. A 13:246–273.
Wilson, R. M. 1975. An existence theory for pairwise balanced designs, III. Proof of the existence conjectures.J. Combin. Theory Ser. A 18:71–79.
Author information
Authors and Affiliations
Additional information
Communicated by: G. Tallini
Rights and permissions
About this article
Cite this article
Buratti, M. A powerful method for constructing difference families and optimal optical orthogonal codes. Des Codes Crypt 5, 13–25 (1995). https://doi.org/10.1007/BF01388501
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01388501