Abstract
A strong indication about the existence of a (7p, 4, 1) difference family with p ≡ 7 (mod 12) a prime has been given in [11]. Here, developing some ideas of that paper, we give, much more generally, a strong indication about the existence of a cyclic (pq, 4, 1) difference family whenever p and q are primes congruent to 7 (mod 12) and of a cyclic (pq, 5, 1) difference family whenever p and q are primes congruent to 11 (mod 20). Indeed we give an algorithm for their construction that seems to be always successful and we have checked it works whenever both primes p and q do not exceed 1,000. All our (pq, 4, 1) and (pq, 5, 1) difference families have the nice property of admitting a multiplier of order 3 or 5, respectively, that fixes almost all base blocks. As an intermediate result we also find an optimal (p, 5, 1) optical orthogonal code for every prime p ≡ 11 (mod 20) not exceeding 10,000.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abel R.J.R., Buratti M.: Some progress on (v, 4, 1) difference families and optical orthogonal codes. J. Combin. Theory Ser. A 106, 59–75 (2004)
Abel R.J.R., Buratti M.: Difference families. In: Colbourn, C.J., Dinitz, J.H. (eds) The CRC handbook of combinatorial designs, 2nd edn, pp. 392–409. Chapman and Hall/CRC Press, Boca Raton, FL (2006)
Abel R.J.R., Costa S., Finizio N.J.: Directed-ordered whist tournaments and (v, 5, 1) difference families: existence results and some new classes of Z-cyclic solutions. Discrete Appl. Math. 143, 43–53 (2004)
Anderson I.: Some 2-rotational and cyclic designs. J. Combin. Des. 4, 247–254 (1996)
Anderson I.: Some cyclic and 1-rotational designs. In: Hirschfeld, J.W.P. (eds) Surveys in Combinatorics, pp. 47–73. Cambridge University Press, London (2001)
Beth T., Jungnickel D., Lenz H.: Design Theory. Cambridge University Press (1999).
Bose R.C.: On the construction of balanced incomplete block designs. Ann. Eugenics 9, 353–399 (1939)
Buratti M.: Improving two theorems of Bose on difference families. J. Combin. Des. 3, 15–24 (1995)
Buratti M.: On simple radical difference families. J. Combin. Des. 3, 161–168 (1995)
Buratti M.: A packing problem and its application to Bose’s families. J. Combin. Des. 4, 457–472 (1996)
Buratti M.: From a (G, k, 1) to a \({(C_k \oplus G, k, 1)}\) difference family. Des. Codes Cryptogr. 11, 5–9 (1997)
Buratti M.: Recursive constructions for difference matrices and relative difference families. J. Combin. Des. 6, 165–182 (1998)
Buratti M., Zuanni F.: Perfect Caley Designs as generalizations of Perfect Mendelsohn Designs. Des. Codes Cryptogr. 23, 233–247 (2001)
Buratti M., Pasotti A.: Combinatorial designs and the theorem of Weil on multiplicative character sums. Finite Fields Appl. 15, 332–344 (2009)
Chen K., Zhu L.: Existence of (q, k, 1) difference families with q a prime power and k = 4, 5. J. Combin. Des. 7, 21–30 (1999)
Colbourn M.J., Colbourn C.J.: Recursive constructions for cyclic block designs. J. Stat. Plan. Inference 10, 97–103 (1984)
Colbourn C.J., Dinitz J.H., Stinson D.R.: Applications of combinatorial designs to communications, cryptography, and networking. In: Lamb, J.D., Preece, D.A. (eds) Surveys in combinatorics, pp. 37–100. Cambridge University Press, London (1999)
Mathon R.: Constructions for cyclic Steiner 2-designs. Ann. Discrete Math. 34, 353–362 (1987)
Peltesohn R.: Eine Losung der beiden Heffterschen Differenzenprobleme. Compos. Math. 6, 251–257 (1938)
Wilson R.M.: Cyclotomic and difference families in elementary abelian groups. J. Number Theory 4, 17–42 (1972)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by K. T. Arasu.
Rights and permissions
About this article
Cite this article
Buratti, M., Pasotti, A. Further progress on difference families with block size 4 or 5. Des. Codes Cryptogr. 56, 1–20 (2010). https://doi.org/10.1007/s10623-009-9335-6
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-009-9335-6