Skip to main content
Log in

Constructions of almost difference sets from finite fields

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

Abstract

Almost difference sets are an interesting subject of combinatorics, and have applications in many areas of engineering such as CDMA communications, error correcting codes and cryptography. The objective of this paper is to present some new constructions of almost difference sets, together with several results on the equivalence relation.

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. Arasu K.T., Ding C., Helleseth T., Kumar P.V., Martinsen H.M.: Almost difference sets and their sequences with optimal autocorrelation. IEEE Trans. Inf. Theory 47(7), 2934–2943 (2001).

    Google Scholar 

  2. Arasu K.T., Jungnickel D., Ma S.L., Pott A.: Strongly regular Cayley graphs with \(\lambda -\mu =-1\). J. Comb. Theory Ser. A 67(1), 116–125 (1994).

    Google Scholar 

  3. Brouwer A.E., Wilson R.M., Xiang Q.: Cyclotomy and strongly regular graphs. J. Algebraic Comb. 10(1), 25–28 (1999).

    Google Scholar 

  4. Cusick T.W., Ding C., Renvall A.: Stream ciphers and number theory. North-Holland Mathematical Library, vol. 66, revised edn. Elsevier Science, Amsterdam (2004).

  5. Davis J.A.: Almost difference sets and reversible divisible difference sets. Arch. Math. (Basel) 59(6), 595–602 (1992).

    Google Scholar 

  6. Ding C.: The differential cryptanalysis and design of natural stream ciphers. In: Fast Software Encryption, pp. 101–115. Springer,Berlin (1994).

  7. Ding C.: Autocorrelation values of generalized cyclotomic sequences of order two. IEEE Trans. Inf. Theory 44(4), 1699–1702 (1998).

    Google Scholar 

  8. Ding C., Helleseth T., Lam K.Y.: Several classes of binary sequences with three-level autocorrelation. IEEE Trans. Inf. Theory 45(7), 2606–2612 (1999).

    Google Scholar 

  9. Ding C., Helleseth T., Martinsen H.: New families of binary sequences with optimal three-level autocorrelation. IEEE Trans. Inf. Theory 47(1), 428–433 (2001).

    Google Scholar 

  10. Ding C., Pott A., Wang Q.: Skew Hadamard difference sets from Dickson polynomials of order 7. Preprint (2012).

  11. Ding C., Wang Z., Xiang Q.: kew Hadamard difference sets from the Ree-Tits slice symplectic spreads in \(\text{ PG}(3,3^{2h+1})\). J. Comb. Theory Ser. A 114(5), 867–887 (2007).

    Google Scholar 

  12. Ding C., Yuan J.: A family of skew Hadamard difference sets. J. Comb. Theory Ser. A 113(7), 1526–1535 (2006).

    Google Scholar 

  13. Feng T., Xiang Q.: Cyclotomic constructions of skew Hadamard difference sets. J. Comb. Theory Ser. A 119(1), 245–256 (2012).

    Google Scholar 

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

    Google Scholar 

  15. Peisert W.: All self-complementary symmetric graphs. J. Algebra 240(1), 209–229 (2001).

    Google Scholar 

  16. Polhill J.: Paley type partial difference sets in non \(p\)-groups. Des. Codes Cryptogr. 52(2), 163–169 (2009).

    Google Scholar 

  17. Polhill J.: Paley partial difference sets in groups of order \(n^4\) and \(9n^4\) for any odd \(n\) > 1. J. Comb. Theory Ser. A 117(8), 1027–1036 (2010).

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

  19. Tang X., Ding C.: New classes of balanced quaternary and almost balanced binary sequences with optimal autocorrelation value. IEEE Trans. Inf. Theory 56(12), 6398–6405 (2010).

    Google Scholar 

  20. Wang Q., Du X.: The linear complexity of binary sequences with optimal autocorrelation. IEEE Trans. Inf. Theory 56(12), 6388–6397 (2010).

    Google Scholar 

  21. Weng G., Hu L.: Some results on skew Hadamard difference sets. Des. Codes Cryptogr. 50(1), 93–105 (2009).

    Google Scholar 

  22. Whiteman A.L.: A family of difference sets. Ill J. Math. 6, 107–121 (1962).

    Google Scholar 

  23. Zhang Y., Lei J.G., Zhang S.P.: A new family of almost difference sets and some necessary conditions. IEEE Trans. Inf. Theory 52(5), 2052–2061 (2006).

    Google Scholar 

Download references

Acknowledgments

The authors are grateful to the two anonymous reviewers for their detailed suggestions and comments that improved the presentation and quality of this paper. Cunsheng Ding’s research is supported by the Hong Kong Research Grants Council under project no. 601311. Qi Wang’s research is supported by the Alexander von Humboldt (AvH) Stiftung/Foundation.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Qi Wang.

Additional information

Communicated by K. T. Arasu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ding, C., Pott, A. & Wang, Q. Constructions of almost difference sets from finite fields. Des. Codes Cryptogr. 72, 581–592 (2014). https://doi.org/10.1007/s10623-012-9789-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-012-9789-9

Keywords

Mathematics Subject Classification (2000)

Navigation