Skip to main content
Log in

Existence of (q,6,1) Difference Families withq a Prime Power

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

The existence of a (q,k,1) difference family in GF(q) has been completely solved for k=3, 4, 5. For k=6 fundamental results have been given by Wilson. In this article, we continue the investigation and show that the necessary condition for the existence of a(q,6,1) difference family in GF(q), i.e. q 1 (mod 30) is also sufficient with one exception of q=61. The method of this paper is to lower Wilson's bound by using Weil's theorem on character sums to exploit Wilson's sufficient conditions for the existence of (q,6,1) difference families. The remaining gap is closed by computer searches.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. I. Anderson, S. D. Cohen, and N. J. Finizio, An existence theorem for cyclic triplewhist tournaments, Discrete Mathematics, Vol. 138 (1995) pp. 31-41.

    Article  Google Scholar 

  2. Th. Beth, D. Jungnickel, and H. Lenz, Design Theory, Bibliographisches Institut, Zurich (1985).

    Google Scholar 

  3. R. C. Bose, On the construction of balanced incomplete block designs, Ann. Eugenics, Vol. 9 (1939) pp. 353-399.

    Google Scholar 

  4. M. Buratti, Constructions for (q, k, 1) difference families with q a prime power and k = 4, 5, Discrete Mathematics, Vol. 138 (1995) pp. 169-175.

    Article  Google Scholar 

  5. M. Buratti, From a (G, k, 1) difference family to a (C kG, k, 1) difference family, Designs, Codes and Cryptography, Vol. 11 (1997) pp. 5-9.

    Google Scholar 

  6. M. Buratti, Improving two theorems of Bose on difference families, J. Combin. Designs, Vol. 3 (1995), pp. 15-24.

    Google Scholar 

  7. M. Buratti, On simple radical difference families, J. Combin. Designs, Vol. 3 (1995) pp. 161-168.

    Google Scholar 

  8. C. J. Colbourn and J. H. Dinitz (eds.), The CRC Handbook of Combinatorial Designs, CRC Press, New York (1996).

    Google Scholar 

  9. K. Chen and L. Zhu, Existence of APAV(q, k) with q a prime power ≡ 3 (mod 4) and k odd > 1, J. Combin. Designs, to appear.

  10. K. Chen and L. Zhu, Existence of (q, k, 1) difference families with q a prime power and k = 4, 5, J. Combin. Designs, to appear.

  11. M. Greig, Some GDD's constructions, J. Combin. Math. Combin. Comp., to appear.

  12. K. B. Gross, On the maximal number of pairwise orthogonal Steiner triple systems, J. Combin. Theory Ser. A Vol. 19 (1975), pp. 256-263.

    Google Scholar 

  13. C. H. A. Ling, Y. Lu, G. H. J. van Rees, and L. Zhu, V(m, t)'s for m = 3, 4, 5, 6, Research Report no. 12, Suzhou University (1997).

  14. R. Lidl and H. Niederreiter, Finite fields, Encyclopedia of Mathematics and Its Applications, Vol. 20, Cambridge University Press, Cambridge (1983).

    Google Scholar 

  15. G. McNay, Cohen's sieve with quadratic conditions, Utilitas Math., Vol. 49 (1996) pp. 191-201.

    Google Scholar 

  16. E. Netto, Zur Theorie der Tripelsysteme, Math. Ann., Vol. 42 (1893) pp. 143-152.

    Google Scholar 

  17. R. M. Wilson, Cyclotomy and difference families in elementary abelian groups, J. Number Theory, Vol. 4 (1972) pp. 17-47.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, K., Zhu, L. Existence of (q,6,1) Difference Families withq a Prime Power. Designs, Codes and Cryptography 15, 167–173 (1998). https://doi.org/10.1023/A:1008311600271

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008311600271

Navigation