Skip to main content
SpringerLink
Log in

Constructions of External Difference Families and Disjoint Difference Families

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

Abstract.

External difference families (EDFs) are a type of new combinatorial designs originated from cryptography. In this paper, some earlier ideas of recursive and cyclotomic constructions of combinatorial designs are extended, and a number of classes of EDFs and disjoint difference families are presented. A link between a subclass of EDFs and a special type of (almost) difference sets is set up.

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. KT Arasu C Ding T Helleseth P Vijay Kumer H Martinsen (2001) ArticleTitleAlmost difference sets and their sequences with optimal autocorrelation IEEE Trans Inform Theory 47 2834–2843

    Google Scholar 

  2. RC Bose (1939) ArticleTitleOn the construction of balanced incomplete block designs Ann Eugen 9 353–399 Occurrence Handle0023.00102

    MATH  Google Scholar 

  3. M Buratti (1998) ArticleTitleRecursive constructions for difference matrices and relative difference families J Combin Des 6 165–182 Occurrence Handle0915.05013 Occurrence Handle1614197 Occurrence Handle10.1002/(SICI)1520-6610(1998)6:3<165::AID-JCD1>3.0.CO;2-D

    Article  MATH  MathSciNet  Google Scholar 

  4. Y Chang L Ji (2004) ArticleTitleOptimal (4up, 5, 1) optical orthogonal codes J Combin Des 5 346–361 Occurrence Handle1071.94031 Occurrence Handle2079257 Occurrence Handle10.1002/jcd.20011

    Article  MATH  MathSciNet  Google Scholar 

  5. K Chen L Zhu (1999) ArticleTitleExistence of (q,k,1) difference families with q a prime power and k = 4,5 J Combin Des 7 21–30 Occurrence Handle0959.35118 Occurrence Handle1660958 Occurrence Handle10.1002/(SICI)1520-6610(1999)7:1<21::AID-JCD4>3.0.CO;2-Y

    Article  MATH  MathSciNet  Google Scholar 

  6. MJ Colbourn CJ Colbourn (1984) ArticleTitleRecursive constructions for cyclic block designs J Statist Plann Inference 10 97–103 Occurrence Handle0553.05018 Occurrence Handle752456 Occurrence Handle10.1016/0378-3758(84)90035-1

    Article  MATH  MathSciNet  Google Scholar 

  7. CJ Colbourn W Launey Particlede (1996) Difference matrices CJ Colbourn JH Dinitz (Eds) The CRC Handbook of Combinatorial Designs CRC Press Boca Raton 287–297

    Google Scholar 

  8. Ding C, Yuan J (to appear) A family of skew difference sets. J Comb Theory A

  9. JH Dinitz P Rodney (1997) ArticleTitleDisjoint difference families with block size 3 Utilitas Math 52 153–160 Occurrence Handle0892.05012 Occurrence Handle1605744

    MATH  MathSciNet  Google Scholar 

  10. JH Dinitz N Shalaby (2002) ArticleTitleBlock disjoint difference families for Steiner triple systems: v≡ 1 (mod 6) J Statist Plann Inference 106 77–86 Occurrence Handle0996.05013 Occurrence Handle1927702 Occurrence Handle10.1016/S0378-3758(02)00204-5

    Article  MATH  MathSciNet  Google Scholar 

  11. R Fuji-Hara Y Miao S Shinohara (2002) ArticleTitleComplete sets of disjoint difference families and their applications J Statist Plann Inference 106 87–103 Occurrence Handle1007.05037 Occurrence Handle1927703 Occurrence Handle10.1016/S0378-3758(02)00205-7

    Article  MATH  MathSciNet  Google Scholar 

  12. M Hall SuffixJr (1956) ArticleTitleA survey of difference sets Proc Amer Math Soc 6 975–986 Occurrence Handle10.2307/2033024

    Article  Google Scholar 

  13. VI Levenshtein (1971) ArticleTitleOne method of constructing quasi codes providing synchronization in the presence of errors Prob Infor Transm 7 IssueID3 215–222

    Google Scholar 

  14. VI Levenshtein (2004) ArticleTitleCombinatorial problems motivated by comma-free codes J Combin Des 12 184–196 Occurrence Handle1059.94011 Occurrence Handle2051403 Occurrence Handle10.1002/jcd.10071

    Article  MATH  MathSciNet  Google Scholar 

  15. R Lidl H Niederreiter (1983) Finite fields. Encyclopedia of mathematics and its applications vol. 20 Cambridge University Press Cambridge

    Google Scholar 

  16. Mutoh Y Difference systems of sets and cyclotomoy II, preprint.

  17. Mutoh Y, Tonchev VD (to appear) Difference systems of sets and cyclotomoy. Discrete Math

  18. W Ogata K Kurosawa DR Stinson H Saido (2004) ArticleTitleNew combinatorial designs and their applications to authentication codes and secret sharing schemes Discrete Math 279 383–405 Occurrence Handle1044.94013 Occurrence Handle2060003 Occurrence Handle10.1016/S0012-365X(03)00283-8

    Article  MATH  MathSciNet  Google Scholar 

  19. REAC Paley (1933) ArticleTitleOn orthogonal matrices J Math Phys MIT 12 311–320 Occurrence Handle0007.10004

    MATH  Google Scholar 

  20. RG Stanton RC Mullin (1968) ArticleTitleConstruction of room squares Ann Math Statist 39 1540–1548 Occurrence Handle0182.52001 Occurrence Handle234587

    MATH  MathSciNet  Google Scholar 

  21. Storer T (1967) Cyclotomy and difference Sets. Markham, Chicago

  22. TW Sze S Chanson C Ding T Helleseth MG Parker (2003) ArticleTitleLogarithm authentication codes Infor Comput 148 IssueID1 93–108 Occurrence Handle1983180 Occurrence Handle10.1016/S0890-5401(03)00053-1

    Article  MathSciNet  Google Scholar 

  23. VD Tonchev (2003) ArticleTitleDifference systems of sets and code synchronization Rendiconti del Seminario Matematico di Messina Ser II 9 217–226 Occurrence Handle2121477

    MathSciNet  Google Scholar 

  24. RM Wilson (1972) ArticleTitleCyclotomy and difference families in elementary Abelian groups J Number Theory 4 17–42 Occurrence Handle0259.05011 Occurrence Handle309755 Occurrence Handle10.1016/0022-314X(72)90009-1

    Article  MATH  MathSciNet  Google Scholar 

  25. J Yin (1998) ArticleTitleSome combinatorial constructions for optical orthogonal codes Discrete Math 185 201–219 Occurrence Handle0949.94010 Occurrence Handle1614321 Occurrence Handle10.1016/S0012-365X(97)00172-6

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Beijing Jiaotong University, Beijing, 100044, China

    Yanxun Chang

  2. Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong, China

    Cunsheng Ding

Authors
  1. Yanxun Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cunsheng Ding
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Cunsheng Ding.

Additional information

Communicated by A. Pott.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chang, Y., Ding, C. Constructions of External Difference Families and Disjoint Difference Families. Des Codes Crypt 40, 167–185 (2006). https://doi.org/10.1007/s10623-006-0005-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-006-0005-7

Keywords

AMS Classification

Search

Navigation