Sets of optimal frequency-hopping sequences

IEEE Transactions on Information Theory

Volumn 54, Issue 8, 2008, Pages 3741-3745

  Ding, Cunsheng ^a   Yin, Jianxing ^b  

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

^b SOOCHOW UNIVERSITY   (China)

Author keywords

Additives; Communication systems; Computer science; Correlation; Cryptography; Cyclotomy; Direct sequence spread spectrum; DNA; Encoding; Equations; Finite element methods; Frequency hopping sequence; Frequency hopping spread spectrum; Galois fields; Generators; Linear feedback shift registers; Mathematics; Object recognition; Polynomials

Indexed keywords

BOOLEAN ALGEBRA; COMMUNICATION SYSTEMS; DIRECT SEQUENCE SYSTEMS; PROGRAMMING THEORY; SPECTRUM ANALYSIS; SPREAD SPECTRUM COMMUNICATION; TECHNOLOGY;

ADDITIVES; ALGEBRAIC CONSTRUCTIONS; CDMA SYSTEMS; CODING TECHNOLOGIES; COMPUTER SCIENCE; CORRELATION; CRYPTOGRAPHY; CYCLOTOMY; DIRECT-SEQUENCE SPREAD SPECTRUM; DNA; ENCODING; EQUATIONS; FINITE ELEMENT METHODS; FREQUENCY-HOPPING SEQUENCE; FREQUENCY-HOPPING SEQUENCES; FREQUENCY-HOPPING SPREAD SPECTRUM; GALOIS FIELDS; GENERATORS; LINEAR FEEDBACK SHIFT REGISTERS; MATHEMATICS; OBJECT RECOGNITION; OPTIMAL FREQUENCIES; POLYNOMIALS;

FREQUENCY HOPPING;

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

References (12)

1. W. Chu and C. J. Colbourn, "Optimal frequency-hopping sequences via cyclotomy," IEEE Trans. Inf. Theory, no. IT-51, pp. 1139-1141, 2005.
2. 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.
3. 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.
4. G. Ge, R. Fuji-Hara, and Y. Miao, "Further combinatorial constructions for optimal frequency hopping sequences," J. Combin. Theory Ser A vol. 113, pp. 1699-1718, 2006.
5. J. J. Komo and S. C. Liu, "Maximal length sequences for frequency hopping," IEEE J. Sel. Areas Commun., vol. 5, pp. 819-822, 1990.
6. P. V. Kumar, "Frequency-hopping code sequence designs having large linear span," IEEE Trans. Inf. Theory, vol. IT-34, pp. 146-151, 1988.
7. A. Lempel and H. Greenberger, "Families of sequences with optimal Hamming correlation properties," IEEE Trans. Inf. Theory, vol. IT-20, pp. 90-94, 1974.
8. 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.
9. R. A. Scholtz, "The spread spectrum concept," IEEE Trans. Commun. vol. COM-25, pp. 748-755, 1977.
10. T. W. Sze, S. Chanson, C. Ding, T. Helleseth, and M. G. Parker, "Logarithm authentication codes," Inf. Comput., vol. 184, no. 1, pp. 93-108, Jul. 2003.
11. T. Storer, Cyclotomy and Difference Sets. Chicago, IL: Markham, 1967.
12. 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.