Skip to main content
Log in

Constructions of optimal difference systems of sets

  • Articles
  • Published:
Science China Mathematics Aims and scope Submit manuscript

Abstract

Difference systems of sets (DSSs) are combinatorial configurations which were introduced in 1971 by Levenstein for the construction of codes for synchronization. In this paper, we present two kinds of constructions of difference systems of sets by using disjoint difference families and a special type of difference sets, respectively. As a consequence, new infinite classes of optimal DSSs are obtained.

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. Chang Y, Ding C. Constructions of external difference families and disjoint difference families. Des Codes Crypt, 2006, 40: 167–185

    Article  MATH  MathSciNet  Google Scholar 

  2. Colbourn M J, Colbourn C J. Recursive constructions for cyclic block designs. J Statist Plann Inference, 1984, 10: 97–103

    Article  MATH  MathSciNet  Google Scholar 

  3. Colbourn C J, de Launey W. Difference matrices. In: Colbourn C J, Dinitz J H, eds. The CRC Handbook of Combinatorial Designs. Boca Raton: CRC Press, 1996, 287–297

    Google Scholar 

  4. Ding C. Optimal and perfect difference systems of sets. J Combin Theory Ser A, 2009, 116: 109–119

    Article  MATH  MathSciNet  Google Scholar 

  5. Fan C L, Lei J G, Chang Y X. Constructions of difference systems of sets and disjoint difference families. IEEE Trans Inform Theory, 2008, 54: 3195–3201

    Article  MathSciNet  Google Scholar 

  6. Fuji-Hara R, Miao Y, Mishima M. Optimal frequency hopping sequences: A combinatorial approach. IEEE Trans Inform Theory, 2004, 50: 2408–2419

    Article  MathSciNet  Google Scholar 

  7. Fuji-Hara R, Munemasa A, Tonchev V D. Hyperplane partitions and difference systems of sets. J Combin Theory Ser A, 2006, 113: 1689–1698

    Article  MATH  MathSciNet  Google Scholar 

  8. Ge G, Fuji-Hara R, Miao Y. Further combinatorial constructions for optimal frequency-hopping sequences. J Combin Theory Ser A, 2006, 113: 1699–1718

    Article  MATH  MathSciNet  Google Scholar 

  9. Muton Y, Tonchev V D. Difference systems of sets and cyclotomy. Discrete Math, 2008, 308: 2959–2969

    Article  MathSciNet  Google Scholar 

  10. Levenshtein V I. One method of constructing quasilinear codes providing synchronization in the presence of errors. Probl Inf Transm, 1971, 7: 215–222

    Google Scholar 

  11. Tonchev V D. Difference systems of sets and code synchronization. Rend Sem Mat Messina Ser II, 2003, 9: 217–226

    MathSciNet  Google Scholar 

  12. Tonchev V D. Partitions of difference sets and code synchronization. Finite Fields Appl, 2005, 11: 601–621

    Article  MATH  MathSciNet  Google Scholar 

  13. Tonchev V D, Wang H. Optimal difference systems of sets with multipliers. Lect Notes Comput Sci, 2006, 3967: 612–618

    Article  Google Scholar 

  14. Tonchev V D, Wang H. An algorithm for optimal difference systems of sets. J Comb Optim, 2007, 14: 165–175

    Article  MATH  MathSciNet  Google Scholar 

  15. Wang H. A new bound for difference systems of sets. J Combin Math Combin Comput, 2006, 58: 161–168

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to CuiLing Fan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fan, C., Lei, J. & Shan, X. Constructions of optimal difference systems of sets. Sci. China Math. 54, 173–184 (2011). https://doi.org/10.1007/s11425-010-4029-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11425-010-4029-0

Keywords

MSC(2000)

Navigation