Sets of frequency hopping sequences: Bounds and optimal constructions

IEEE Transactions on Information Theory

Volumn 55, Issue 7, 2009, Pages 3297-3304

  Ding, Cunsheng ^a   Fuji Hara, Ryoh ^b   Fujiwara, Yuichiro ^b   Jimbo, Masazaku ^c   Mishima, Miwako ^d  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b UNIVERSITY OF TSUKUBA   (Japan)

^c NAGOYA UNIVERSITY   (Japan)

^d GIFU UNIVERSITY   (Japan)

Author keywords

Cyclotomy; Direct sequence spread spectrum(DSSS); Frequency hopping sequence; Frequency hopping spread spectrum

Indexed keywords

CODING TECHNOLOGY; CYCLOTOMY; DIRECT SEQUENCE SPREAD SPECTRUM; DIRECT SEQUENCE SPREAD SPECTRUM(DSSS); FREQUENCY HOPPING SEQUENCE; FREQUENCY HOPPING SEQUENCES; FREQUENCY HOPPING SPREAD SPECTRUM; FREQUENCY-HOPPING CODES; NEW PARAMETERS; OPTIMAL CONSTRUCTION; OPTIMAL SETS;

ADAPTIVE FILTERING; CODES (SYMBOLS); COMMUNICATION SYSTEMS; DIRECT SEQUENCE SYSTEMS; PACKET NETWORKS; SPECTROSCOPY;

FREQUENCY HOPPING;

EID: 67650156064     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2009.2021366     Document Type: Article

References (26)

1. W. Chu and C. J. Colbourn, "Optimal frequency-hopping sequences via cyclotomy," IEEE Trans. Inf. Theory, vol. IT-51, pp. 1139-1141, 2005.
2. C. J. Colbourn and J. H. Dinitz, CRC Handbook of Combinatorial Designs, 2nd ed. Boca Raton, FL: Champion and Hall/CRC, 2006.
3. C. Ding, "Complex codebooks from combinatorial designs," IEEE Trans. Inf. Theory, vol. 52, no. 9, pp. 4229-4235, Sep. 2006.
4. C. Ding, M. Miosio, and J. Yuan, "Algebraic constructions of optimal frequency hopping sequences," IEEE Trans. Inf. Theory, vol. 53, no. 7, pp. 2606-2610, Jul. 2007.
5. C. Ding and J. Yin, "Sets of optimal frequency hopping sequences," IEEE Trans. Inf. Theory, vol. IT-54, no. 8, pp. 3741-3745, Aug. 2008.
6. k and generalized designs," Discrete Math., vol. 169, pp. 55-82, 1998.
7. F.-W. Fu, A. J. Han Vinck, and S. Y. Shen, "On the construction of constant-weight codes," IEEE Trans. Inf. Theory, vol. 44, no. 1, pp. 328-333, 1998.
8. F.-W. Fu, T. Kløve, Y. Luo, and W. Wei, "On the Svanström bound for ternary constant-weight codes," IEEE Trans. Inf. Theory, vol. 47, no. 5, pp. 2061-2064, 2001.
9. Y. Fujiwara and R. Fuji-Hara, "Frequency hopping sequences with optimal auto- and cross-correlation properties and related codes," in Proc. 10th Int. Workshop on Algebr. Combinator. Coding Theory, Zvenigorod, Russia, Sep. 2006, pp. 83-96.
10. R. Fuji-Hara, Y. Miao, and M. Mishima, "Optimal frequency hopping sequences: A combinatorial approach," IEEE Trans. Inf. Theory, vol. IT-50, pp. 2408-2420, 2004.
11. G. Ge, R. Fuji-Hara, and Y. Miao, "Further combinatorial constructions for optimal frequency hopping sequences," J. Combinator. Theory Ser. A, vol. 113, pp. 1699-1718, 2006.
12. W. C. Huffman and V. Pless, Fundamentals of Error-Correcting Codes Cambridge, U.K.: Cambridge Univ. Press, 2003.
13. J. J. Komo and S. C. Liu, "Maximal length sequences for frequency hopping," IEEE J. Sel. Areas Commun., vol. 5, pp. 819-822, 1990.
14. P. V. Kumar, "Frequency-hopping code sequence designs having large linear span," IEEE Trans. Inf. Theory, vol. IT-34, pp. 146-151, 1988.
15. A. Lempel and H. Greenberger, "Families of sequences with optimal Hamming correlation properties," IEEE Trans. Inf. Theory, vol. IT-20, pp. 90-94, 1974.
16. S. Lin and C. Xing, Coding Theory: A First Course. Cambridge, U.K.: Cambridge Univ. Press, 2004.
17. G. Myerson, "Period polynomials and Gauss sums for finite fields," Acta Arithmetica, vol. XXXIX, pp. 251-264, 1981.
18. P. R. J. Östergaard, M. Fossorier, H. Imai, S. Lin, and A. Poli, Eds., "On binary/ternary error-correcting codes with minimum distance 4," in Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. Berlin, Germany: Springer, 1999, pp. 472-481, LNCS 1719.
19. P. R. J. Östergaard and M. Svanström, "Ternary constant weight codes," The Electron. J. Combinator., vol. 9, pp. 1-22, 2002.
20. D. Peng and P. Fan, "Lower bounds on the Hamming auto- and cross correlations of frequency-hopping sequences," IEEE Trans. Inf. Theory, vol. IT-50, pp. 2149-2154, 2004.
21. R. A. Scholtz, "The spread spectrum concept," IEEE Trans. Commun. vol. COM-25, pp. 748-755, 1977.
22. T. Storer, Cyclotomy and Difference Sets.. Chicago, IL: Markham, 1967.
23. M. Svanström, "A lower bound for ternary constant-weight codes," IEEE Trans. Inf. Theory, vol. 43, pp. 1630-1632, 1997.
24. M. Svanström, "A class of perfect ternary constant-weight codes," Designs, Codes and Cryptogr., vol. 18, pp. 223-229, 1999.
25. P. Udaya and M. N. Siddiqi, "Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings," IEEE Trans. Inf. Theory, vol. IT-44, pp. 1492-1503, 1998.
26. J. H. van Lint, Introduction to Coding Theory, 2nd ed. New York: Springer-Verlag, 1992.