Skip to main content
SpringerLink
Log in

Strong difference families, difference covers, and their applications for relative difference families

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

Abstract

In (M. Buratti, J Combin Des 7:406–425, 1999), Buratti pointed out the lack of systematic treatments of constructions for relative difference families. The concept of strong difference families was introduced to cover such a problem. However, unfortunately, only a few papers consciously using the useful concept have appeared in the literature in the past 10 years. In this paper, strong difference families, difference covers and their connections with relative difference families and optical orthogonal codes are discussed.

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

Access this article

Log in via an institution

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. 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 & Hall CRC Press, Boca Raton, FL (2006)

    Google Scholar 

  2. Arasu K.T., Bhandari A.K., Ma S.L., Sehgal S.: Regular difference covers. Kyungpook Math. J. 45, 137–152 (2005)

    MATH  MathSciNet  Google Scholar 

  3. Arasu K.T., Sehgal S.: Cyclic difference covers. Austral. J. Combin. 32, 213–223 (2005)

    MATH  MathSciNet  Google Scholar 

  4. Beth T., Jungnickel D., Lenz H.: Design Theory. Cambridge University Press, Cambridge (1999)

    Google Scholar 

  5. Bird I.C.M., Keedwell A.D.: Design and applications of optical orthogonal codes—a survey. Bull. Inst. Combin. Appl. 11, 21–44 (1994)

    MATH  MathSciNet  Google Scholar 

  6. Buratti M.: Private e-mail communications.

  7. Buratti M.: Recursive constructions for difference matrices and relative difference families. J. Combin. Des. 6, 165–182 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  8. Buratti M.: Old and new designs via difference multisets and strong difference families. J. Combin. Des. 7, 406–425 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  9. Buratti M.: Cyclic designs with block size 4 and related optimal optical orthogonal codes. Des. Codes Cryptogr. 26, 111–125 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  10. Buratti M., Gionfriddo L.: Strong difference families over arbitrary graphs. J. Combin. Des. 16(6), 443–461 (2008)

    Article  MathSciNet  Google Scholar 

  11. Buratti M., Pasotti A.: Combinatorial designs and the theorem of Weil on multiplicative character sums (preprint).

  12. Chang Y., Fuji-Hara R., Miao Y.: Combinatorial constructions of optimal optical orthogonal codes with weight 4. IEEE Trans. Inform. Theory 49, 1283–1292 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  13. Chang Y., Ji L.: Optimal (4up,5,1) optical orthogonal codes. J. Combin. Des. 12, 346–361 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  14. Chen K., Ge G., Zhu L.: Starters and related codes. J. Stat. Plan. Infer. 86, 379–395 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  15. Chung F.R.K., Salehi J.A., Wei V.K.: Optical orthogonal codes: design, analysis and applications. IEEE Trans. Inform. Theory 35, 595–604 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  16. Colbourn C.J., Dinitz J.H., Stinson D.R.: Applications to communications, cryptography, and networking. London Math. Soc. Lecture Note Ser. 267, 37–100 (1999)

    MathSciNet  Google Scholar 

  17. Davis J.A.: Partial difference sets in p-groups. Archiv der Math. 63, 103–110 (1994)

    Article  MATH  Google Scholar 

  18. Fuji-Hara R., Miao Y.: Optical orthogonal codes: their bounds and new optimal constructions. IEEE Trans. Inform. Theory 46, 2396–2406 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  19. Fuji-Hara R., Miao Y., Yin J.: Optimal (9v,4,1) optical orthogonal codes. SIAM J. Discrete Math. 14, 256–266 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  20. Ge G., Yin J.: Constructions for optimal (v, 4, 1) optical orthogonal codes. IEEE Trans. Inform. Theory 47, 2998–3004 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  21. Ireland K., Rosen M.: A Classical Introduction to Modern Number Theory. Springer, New York (1981)

    Google Scholar 

  22. Leung H.K., Ma S.L., Schmidt B.: New Hadamard matrices of order 4p 2 obtained from Jacobi sum of order 16. J. Combin. Theory A 113, 822–838 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  23. Leung K.H., Ma S.L., Schmidt B.: Proper partial geometries with Singer groups and pseudogeometric partial difference sets. J. Combin. Theory A 115, 147–177 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  24. Ma S.L.: A survey of partial difference sets. Des. Codes Cryptogr. 4, 221–261 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  25. Ma S., Chang Y.: A new class of optimal optical orthogonal codes with weight five. IEEE Trans. Inform. Theory 50, 1848–1850 (2004)

    Article  MathSciNet  Google Scholar 

  26. Moreno C.J., Wagstaff S.S. Jr.: Sums of squares of integers, 1st edn. Chapman & Hall CRC Press, Boca Raton, FL (2005)

    MATH  Google Scholar 

  27. Polhill J.: New negative Latin square type partial difference sets in nonelementary abelian 2-groups and 3-groups. Des. Codes Cryptogr. 46, 365–377 (2008)

    Article  MathSciNet  Google Scholar 

  28. Ray-Chaudhuri D.K., Chen Y.Q., Xiang Q.: Constructions of partial difference sets and relative difference sets using Galois rings II. J. Combin. Theory A 76, 179–196 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  29. Storer T.: Cyclotomy and Difference Sets, Lectures in Advanced Mathematics. Markham Publishing Company, Chicago (1967)

    Google Scholar 

  30. Wallis W.D.: Combinatorial Designs, Monographs and Textbooks in Pure and Applied Mathematics, Ser. 118, pp. 46–54. Marcel Dekker, Inc., New York (1988).

  31. Wilson R.M.: Cyclotomy and difference families in elementary abelian groups. J. Number Theory 4, 17–47 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  32. Yamada M.: Supplementary difference sets and Jacobi sums. Discrete Math. 103, 75–90 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  33. Yin J.: Some combinatorial constructions for optical orthogonal codes. Discrete Math. 185, 201–219 (1998)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information Science, Nagoya University, Furo-cho, Chikusa-ku, 464-8601, Japan

    Koji Momihara

Authors
  1. Koji Momihara
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Koji Momihara.

Additional information

Communicated by Communicated by K.T. Arasu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Momihara, K. Strong difference families, difference covers, and their applications for relative difference families. Des. Codes Cryptogr. 51, 253–273 (2009). https://doi.org/10.1007/s10623-008-9259-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-008-9259-6

Keywords

Mathematics Subject Classification (2000)

Search

Navigation