Optimal frequency hopping sequences: A combinatorial approach

IEEE Transactions on Information Theory

Volumn 50, Issue 10, 2004, Pages 2408-2420

  Fuji Hara, Ryoh ^a   Miao, Ying ^a   Mishima, Miwako ^b  

^a UNIVERSITY OF TSUKUBA   (Japan)

^b GIFU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL GEOMETRY; FREQUENCY SHIFT KEYING; MATRIX ALGEBRA; OPTIMIZATION; SPREAD SPECTRUM COMMUNICATION; THEOREM PROVING;

AFFINE GEOMETRIES; CYCLIC DESIGNS; DIFFERENCE FAMILIES; DIFFERENCE MATRICES; DIFFERENCE PACKINGS; FREQUENCY HOPPING (FH) SEQUENCES; MULTIPLE FREQUENCY SHIFT KEYING; PARTITION TYPE; RESOLVABLE DESIGN; ULTRA WIDEBAND (UWB);

FREQUENCY HOPPING;

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

References (38)

1. R. J. R. Abel, "Difference families," in The CRC Handbook of Combinatorial Designs, C. J. Colboum and J. H. Dinitz, Eds. Boca Raton, FL: CRC, 1996, pp. 270-287.
2. R. J. R. Abel, M. Buratti, M. Greig, and Y. Miao, "Constructions for rotational near resolvable block designs," J. Combin. Des., vol. 9, pp. 157-181, 2001.
3. I. Anderson, Combinatorial Designs: Constructions and Methods. Chichester, U.K.: Ellis Horwood, 1990.
4. T. Beth, D. Jungnickel, and H. Lenz, Design Theory, 2nd ed. Cambridge, U.K.: Cambridge Univ. Press, 1999, vol. 1 and 2.
5. A. Beutelspacher, "Classical geometries," in The CRC Handbook of Combinatorial Designs, C. J. Colboum and J. H. Dinitz, Eds. Boca Raton, FL: CRC, 1996, pp. 694-708.
6. Specification of the Bluetooth System - Core. The Official Bluetooth Website. The Bluetooth Special Interest Group (SIG). [Online]. Available: http://www.bluetooth.com/
7. M. Buratti, "Improving two theorems of Bose on difference families," J. Combin. Des., vol. 3, pp. 15-24, 1995.
8. M. Buratti, "On simple radical difference families," J. Combin. Des., vol. 3, pp. 161-168, 1995.
9. M. Buratti, "Recursive constructions for difference matrices and relative difference families," J. Combin. Des., vol. 6, pp. 165-182, 1998.
10. K. Chen and L. Zhu, "Existence of (q, 6, 1) difference families with q a prime power," Des., Codes Cryptogr, vol. 15, pp. 167-173, 1998.
11. K. Chen and L. Zhu, "Existence of (q, k, 1) difference families with q a prime power and k = 4, 5," J. Combin. Des., vol. 7, pp. 21-30, 1999.
12. C. J. Colbourn and W. de Launey, "Difference matrices," in The CRC Handbook of Combinatorial Designs, C. J. Colbourn and J. H. Dinitz, Eds. Boca Raton, FL: CRC, 1996, pp. 287-297.
13. The CRC Handbook of Combinatorial Designs, C. J. Colbourn and J. H. Dinitz, Eds., CRC, Boca Raton, FL, 1996.
14. M. J. Colbourn and C. J. Colbourn, "Recursive constructions for cyclic block designs," J. Statist. Plann. Inference, vol. 10, pp. 97-103, 1984.
15. M. J. Colbourn and R. A. Mathon, "On cyclic Steiner 2-designs," Ann. Discr Math., vol. 7, pp. 215-253, 1980.
16. R. Craigen, "Hadamard matrices and designs," in The CRC Handbook of Combinatorial Designs, C. J. Colbourn and J. H. Dinitz, Eds. Boca Raton, FL: CRC, 1996, pp. 370-377.
17. T. W. Cusick, C. Ding, and A. Renvall, Stream Ciphers and Number Theory. Amsterdam, The Netherlands: Elsevier, 1998.
18. J. Dinitz and P. Rodney, "Disjoint difference families with block size 3," Utilitas Math., vol. 52, pp. 153-160, 1997.
19. R. C. Dixon, Spread Spectrum Systems. New York: Wiley, 1976.
20. P. Fan and M. Darnell, Sequence Design for Communications Applications. New York: Wiley, 1996.
21. M. Genma, M. Mishima, and M. Jimbo, "Cyclic resolvability of cyclic Steiner 2-designs," J. Combin. Des., vol. 5, pp. 177-187, 1997.
22. M. Hall, Combinatorial Theory, 2nd ed. New York: Wiley, 1986.
23. M. Jimbo, private communication.
24. S. Kageyama and Y. Miao, "A construction for resolvable designs and its generalizations," Graphs Comb., vol. 14, pp. 11-24, 1998.
25. J. J. Komo and S. C. Liu, "Maximal length sequences for frequency hopping," IEEE J. Select. Areas Commun., vol. 5, pp. 819-822, 1990.
26. P. V. Kumar, "Frequency-hopping code sequence designs having large linear span," IEEE Trans. Inform. Theory, vol. 34, pp. 146-151, Jan. 1988.
27. C. Lam and Y. Miao, "On cyclically resolvable cyclic Steiner 2-designs," J. Combin. Theory Ser. A, vol. 85, pp. 194-207, 1999.
28. A. Lempel and H. Greenberger, "Families of sequences with optimal Hamming correlation properties," IEEE Trans. Inform. Theory, vol. IT-20, pp. 90-94, Jan. 1974.
29. R. M. Mersereau and T. S. Seay, "Multiple access frequency hopping patterns with low ambiguity," IEEE Trans. Aerosp. Electron. Syst., vol. AES-17, pp. 571-578, July 1981.
30. M. Mishima and M. Jimbo, "Some types of cyclically resolvable cyclic Steiner 2-designs," Congr. Numer., vol. 123, pp. 193-203, 1997.
31. E. Netto, "Zur Theorie der Triplesysteme," Math. Ann., vol. 42, pp. 143-152, 1893.
32. B. T. Rumov, "Resolvable designs of finite geometry and related designs," Math. Zametki, vol. 41, pp. 573-591, 1987.
33. R. A. Scholtz, "The spread spectrum concept," IEEE Trans. Commun., vol. COM-25, pp. 748-755, Aug. 1977.
34. R. A. Scholtz, "Multiple access with time-hopping impulse modulations," in Prof. MILCOM 1993, Bedford, MA, 1993, pp. 11-13.
35. G. Solomon, "Optimal frequency hopping sequences for multiple access," in Proc. 1973 Symp. Spread Spectrum Communication, vol. 1, paper AD 915 852, pp. 33-35.
36. P. Udaya and M. N. Siddiqi, "Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings," IEEE Trans. Inform. Theory, vol. 44, pp. 1492-1503, July 1998.
37. J. H. van Lint and R. M. Wilson, A Cource in Combinatorics. Cambridge, U.K.: Cambridge Univ. Press, 1992.
38. R. M. Wilson, "Cyclotomy and difference families in elementary Abelian groups," J. Number Theory, vol. 4, pp. 17-47, 1972.