Skip to main content
Log in

More DD difference sets

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

Abstract

Dillon and Dobbertin proved that if L := GF(2m), gcd(k, m) = 1, d := 4k − 2k + 1 and Δ k (x) := (x + 1)d + x d + 1, then B k := L k (L) is a difference set in the cyclic multiplicative group L  ×  of L. Used in the proof were the auxiliary functions \(c_k^{\gamma}(x) := b_k(\gamma x^{2^k+1})\) , where γ is in L  ×  and b k is the characteristic function of B k on L. When m is odd \(c_k^{\gamma}\) is itself the characteristic function of a cyclic difference set which is equivalent to B k . In this paper we point out that when m is even and γ is not a cube in L then \(c_k^{\gamma}\) is the characteristic function of a difference set in the elementary abelian additive group of L; i.e. \(c_k^{\gamma}\) is a bent function.

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.

Similar content being viewed by others

References

  1. Assmus Jr. E.A., Key J.D.: Designs and Their Codes, Cambridge Tracts in Mathematics, vol. 103. Cambridge University Press, Cambridge (1992).

  2. Assmus E.A. Jr., Salwach C.J. (1979). The (16, 6, 2) designs. Int. J. Math. Math. Sci. 2, 261–281

    Article  MATH  MathSciNet  Google Scholar 

  3. Baumert L.D. (1971). Cyclic Difference Sets, Lecture Notes in Mathematics, vol. 182. Springer-Verlag, Berlin

    Google Scholar 

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

    Google Scholar 

  5. Carmichael R.: Introduction to the Theory of Groups of Finite Order. Ginn and Co. (1937).

  6. Dillon J.F.: Elementary Hadamard difference sets. Ph.D thesis. University of Maryland (1974).

  7. Dillon J.F. (1985). Variations on a scheme of McFarland for noncyclic difference sets. J. Comb. Theory Ser. A 40, 9–21

    Article  MATH  MathSciNet  Google Scholar 

  8. Dillon J.F. (1999). Multiplicative difference sets via additive characters. Des. Codes Cryptogr. Assmus Memorial Issue 17, 225–235

    Article  MATH  MathSciNet  Google Scholar 

  9. Dillon J.F., Dobbertin H. (2004). New cyclic difference sets with Singer parameters. Finite Fields Appl. 10, 342–389

    Article  MATH  MathSciNet  Google Scholar 

  10. Dobbertin H. (1999). Kasami power functions, permutation polynomials and cyclic difference sets. In: Pott A., Kumar P.V., Helleseth T., Jungnickel D. (eds). Difference Sets, Sequences and their Correlation Properties, Proceedings of the NATO Advanced Study Institute on Difference Sets, Sequences and their Correlation Properties. Kluwer, Dordrecht, pp. 133–158

    Google Scholar 

  11. Hall M. Jr. (1986). Combinatorial Theory, 2nd edn. Wiley, New York

    MATH  Google Scholar 

  12. Jordan C. (1870). Traité des substitutions et des équations algébriques. Gauthier-Villars, Paris

    Google Scholar 

  13. Jungnickel D., Pott A., Smith K.W.: Difference Sets. In: Colburn C., Dinitz J. (eds.) Handbook of Combinatorial Designs, 2nd edn., pp. 419–435. Chapman and Hall/CRC, Boca Raton (2007).

  14. Kantor W.M. (1975). Symplectic groups, symmetric designs and line ovals. J. Algebra 33, 43–58

    Article  MATH  MathSciNet  Google Scholar 

  15. Leander N.G.: Another class of non-normal bent functions. In: Proceedings BFCA06 (2006).

  16. Mann H.B. (1965). Addition Theorems. Interscience, New York

    MATH  Google Scholar 

  17. Rothaus O.S. (1976). On Bent functions. J. Comb. Theory Ser. A 20, 300–395

    Article  MATH  MathSciNet  Google Scholar 

  18. Singer J. (1938). A theorem in finite projective geometry and some applications to number theory. Trans. Amer. Math. Soc. 43, 377–385

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to J. F. Dillon.

Additional information

In memory of our friend and colleague Hans Dobbertin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dillon, J.F. More DD difference sets. Des. Codes Cryptogr. 49, 23–32 (2008). https://doi.org/10.1007/s10623-008-9188-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-008-9188-4

Keywords

AMS Classifications

Navigation