Skip to main content
SpringerLink
Log in

New Constructions of Disjoint Distinct Difference Sets

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

Abstract

New constructions of regular disjoint distinct difference sets (DDDS) are presented. In particular, multiplicative and additive DDDS are considered.

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. W. C. Babcock, Intermodulation interference in radio systems, Bell Syst. Tech. J., Vol. 31 (1953) pp. 63-73.

    Google Scholar 

  2. E. J. Blum, J. C. Ribes and F. Biraud, Some new possibilities of optimal synthetic linear arrays for radioastronomy, Astronomy Astrophys., Vol. 41 (1975) pp. 409-411.

    Google Scholar 

  3. R. L. C. J. Colbourn and J. H. Dinitz, The CRC Handbook of Combinatorial Designs, CRC Press (1996).

  4. W. Chen, A mathematical problem in the distribution of frequencies for mobile radio systems (in Chinese), J. Syst. Math. Sci., Vol. 2, No.1 (1982) pp. 28-35.

    Google Scholar 

  5. Z. Chen, Further results on difference triangle sets, IEEE Trans. Inform. Theory, Vol. 40 (1994) pp. 1268-1270.

    Article  Google Scholar 

  6. Z. Chen et al., Disjoint difference sets, difference triangle sets and related codes, IEEE Trans. Inform. Theory, Vol. 38 (1992) pp. 518-522.

    Article  Google Scholar 

  7. S. W. Golomb, How to number a graph, Graph Theory and Computing, (R. C. Read, ed.), Academic Press, New York (1972) pp. 23-37.

    Google Scholar 

  8. M. Hall, Combinatorial Theory, 2nd. ed., John Wiley (1986).

  9. T. Kløve, Bounds on the size of optimal difference triangle sets, IEEE Trans. Inform. Theory, Vol. 34 (1988) pp. 355-361.

    Article  Google Scholar 

  10. T. Kløve, Bounds and constructions of disjoint distinct difference sets, IEEE Trans. Inform. Theory, Vol. 36 (1990) pp. 184-190.

    Article  Google Scholar 

  11. J. P. Robinson and A. J. Bernstein, A class of recurrent codes with limited error propagation, IEEE Trans. Inform. Theory Vol. 13, (1967) pp. 106-113.

    Article  Google Scholar 

  12. J. A. Salehi, F. K. Chung and V. K. Wei, Optical orthogonal codes: designs, analysis, and applications, IEEE Trans. Inform. Theory, Vol. 35 (1989) pp. 595-604.

    Article  Google Scholar 

  13. R. L. Townsend and E. J. Weldon, Jr., Self-orthogonal quasi-cyclic codes, IEEE Trans. Inform. Theory, Vol. 13 (1967) pp. 183-195.

    Article  Google Scholar 

  14. W. W. Wu, New convolutional codes - Part I, IEEE Trans. Commun., Vol. 23 (1975) pp. 942-956; - Part II, IEEE Trans. Commun., Vol. 24 (1976) pp. 19-33.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Academia Sinica and Key State Lab. of Information Security, Graduate School of Academia Sinica, Institute of Systems Science, Beijing, 100080, China

    Wende Chen

  2. School of Engineering, Kristianstad University, S-29139, Kristianstad, Sweden

    Zhi Chen

  3. Department of Informatics, University of Bergen, HIB, N-5020, Bergen, Norway

    Torleiv Klove

Authors
  1. Wende Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhi Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Torleiv Klove
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, W., Chen, Z. & Klove, T. New Constructions of Disjoint Distinct Difference Sets. Designs, Codes and Cryptography 15, 157–165 (1998). https://doi.org/10.1023/A:1008359416200

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008359416200

Search

Navigation