Skip to main content
SpringerLink
Log in

Combinatorial characterizations of one-coincidence frequency-hopping sequences

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

Abstract

Combinatorial characterizations of one-coincidence frequency-hopping (FH) sequences are provided in terms of perfect Mendelsohn packings. As a consequence, results on perfect Mendelsohn packings can be immediately applied to one-coincidence FH sequences.

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. Bennett FE (1999) A brief survey of perfect Mendelsohn packings and covering designs. Discrete Appl Math 95:73–81

    Article  MATH  MathSciNet  Google Scholar 

  2. Bennett FE (2001) Recent progress on the existence of perfect Mendelsohn designs. J Statist Plann Inference 94:121–138

    Article  MATH  MathSciNet  Google Scholar 

  3. Chu W, Colbourn CJ (2005) Optimal frequency hopping sequences via cyclotomy. IEEE Trans Inform Theory 51:1139–1141

    Article  MathSciNet  Google Scholar 

  4. Fan P, Darnell M (1996) Sequence design for communications applications. Research Studies Press LTD, Taunton, England

    Google Scholar 

  5. Fuji-Hara R, Miao Y, Mishima M (2004) Optimal frequency hopping sequences: a combinatorial approach. IEEE Trans Inform Theory 50:2408–2420

    Article  MathSciNet  Google Scholar 

  6. Ge G, Fuji-Hara R, Miao Y (xxxx) Further combinatorial constructions for optimal frequency-hopping sequences. J Combin Theory Ser A to appear

  7. Mendelsohn E (1996) Mendelsohn designs. In: Colbourn CJ, Dinitz JH (eds), The CRC handbook of combinatorial designs. CRC Press, Boca Raton, pp 388–393

    Google Scholar 

  8. Mendelsohn NS (1977) Perfect cyclic designs. Discrete Math 20:63–68

    Article  MathSciNet  Google Scholar 

  9. McEliece RJ (1981) Some combinatorial aspects of spread spectrum communication systems. In: Skwirzynski JK Alphen ann den Rijn (eds), New concepts in multi-user communication. Sitjhoff and Noordhoff, The Netherlands, pp 83–103

  10. Reed IS, Stewart RM (1971) K-th order near-orthogonal codes. IEEE Trans IT 15:116–117

    Google Scholar 

  11. Sharr AA, Davies PA (1984) A survey of one-coincidence sequences for frequency-hopped spread-spectrum systems. IEE Proc Part F 131:719–724

    Google Scholar 

  12. Titlebaum EL (1981) Time frequency hop signals, Part I: coding based upon the theory of linear congruences. IEEE Trans AES-17:490–493

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, 200030, P. R. China

    Zhenfu Cao

  2. Department of Mathematics, Zhejiang University, Hangzhou, 310027, P. R. China

    Gennian Ge

  3. Department of Social Systems and Management, Graduate School of Systems and Information Engineering, University of Tsukuba, Tsukuba, Ibaraki, 305-8573, Japan

    Ying Miao

Authors
  1. Zhenfu Cao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gennian Ge
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ying Miao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ying Miao.

Additional information

Communicated by C. J. Colbourn.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cao, Z., Ge, G. & Miao, Y. Combinatorial characterizations of one-coincidence frequency-hopping sequences. Des Codes Crypt 41, 177–184 (2006). https://doi.org/10.1007/s10623-006-9007-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-006-9007-8

Keywords

AMS Classifications

Search

Navigation