Table of Contents
ISRN Combinatorics
Volume 2013, Article ID 479408, 4 pages
http://dx.doi.org/10.1155/2013/479408
Research Article

Construction of Optimal Sets of Frequency Hopping Sequences

Department of Mathematics, Changshu Institute of Technology, Changshu, Jiangsu 215500, China

Received 18 December 2012; Accepted 3 January 2013

Academic Editors: C. da Fonseca and A. V. Kelarev

Copyright © 2013 Bin Wen. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. A. Scholtz, “Spread spectrum concept,” IEEE Transactions on Communications, vol. 25, no. 8, pp. 748–755, 1977. View at Google Scholar · View at Scopus
  2. P. Fan and M. Darnell, Sequence Design for Communications Applications, Research Studies Press, Taunton, UK, 1996.
  3. P. V. Kumar, “Frequency-hopping code sequence designs having large linear span,” IEEE Transactions on Information Theory, vol. 34, no. 1, pp. 146–151, 1988. View at Publisher · View at Google Scholar · View at MathSciNet
  4. A. Lempel and H. Greenberger, “Families of sequences with optimal Hamming correlation properties,” IEEE Transactions on Information Theory, vol. IT-20, pp. 90–94, 1974. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. D. Peng and P. Fan, “Lower bounds on the Hamming auto- and cross correlations of frequency-hopping sequences,” IEEE Transactions on Information Theory, vol. 50, no. 9, pp. 2149–2154, 2004. View at Publisher · View at Google Scholar · View at MathSciNet
  6. B. Wen, Y. Li, and C. Shi, “A construction of optimal sets of FH sequences,” The Australasian Journal of Combinatorics, vol. 50, pp. 37–44, 2011. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. W. Chu and C. J. Colbourn, “Optimal frequency-hopping sequences via cyclotomy,” IEEE Transactions on Information Theory, vol. 51, no. 3, pp. 1139–1141, 2005. View at Publisher · View at Google Scholar · View at Scopus
  8. C. Ding, M. J. Moisio, and J. Yuan, “Algebraic constructions of optimal frequency-hopping sequences,” IEEE Transactions on Information Theory, vol. 53, no. 7, pp. 2606–2610, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. R. Fuji-Hara, Y. Miao, and M. Mishima, “Optimal frequency hopping sequences: a combinatorial approach,” IEEE Transactions on Information Theory, vol. 50, no. 10, pp. 2408–2420, 2004. View at Publisher · View at Google Scholar · View at MathSciNet
  10. G. Ge, R. Fuji-Hara, and Y. Miao, “Further combinatorial constructions for optimal frequency-hopping sequences,” Journal of Combinatorial Theory A, vol. 113, no. 8, pp. 1699–1718, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. P. Udaya and M. U. Siddiqi, “Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings,” IEEE Transactions on Information Theory, vol. 44, no. 4, pp. 1492–1503, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. C. Ding and J. Yin, “Sets of optimal frequency-hopping sequences,” IEEE Transactions on Information Theory, vol. 54, no. 8, pp. 3741–3745, 2008. View at Publisher · View at Google Scholar · View at MathSciNet
  13. J. Yin, “A construction of optimal sets of FH sequences,” in Coding and Cryptology, vol. 4 of Series on Coding Theory and Cryptology, pp. 268–276, World Scientific, Hackensack, NJ, USA, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. Z.-X. Wan, Lectures on Finite Fields and Galois Rings, World Scientific Publishing, River Edge, NJ, USA, 2003. View at MathSciNet