Sets of Optimal Frequency-Hopping Sequences

In communication systems, frequency-hopping spread spectrum and direct-sequence spread spectrum are two main spread coding technologies. Frequency-hopping sequences are needed in FH-CDMA systems. In this correspondence, three algebraic constructions of sets of optimal frequency-hopping sequences are presented. The parameters of these sets of frequency-hopping sequences are new and flexible.

[1]  Charles J. Colbourn,et al.  Optimal frequency-hopping sequences via cyclotomy , 2005, IEEE Transactions on Information Theory.

[2]  Daiyuan Peng,et al.  Lower Bounds on the Hamming Auto- and Cross Correlations of Frequency-Hopping Sequences , 2004, IEEE Trans. Inf. Theory.

[3]  Cunsheng Ding,et al.  Combinatorial constructions of optimal constant-composition codes , 2005, IEEE Transactions on Information Theory.

[4]  Patric R. J. Östergård,et al.  Bounds and constructions for ternary constant-composition codes , 2002, IEEE Trans. Inf. Theory.

[5]  Hao Shen,et al.  The PBD-Closure of Constant-Composition Codes , 2007, IEEE Transactions on Information Theory.

[6]  Victor Zinoviev,et al.  Spherical codes generated by binary partitions of symmetric pointsets , 1995, IEEE Trans. Inf. Theory.

[7]  T. Storer.  Cyclotomy and difference sets , 1967 .

[8]  Cunsheng Ding,et al.  Algebraic constructions of constant composition codes , 2005, IEEE Trans. Inf. Theory.

[9]  Mattias Svanström.  Constructions of ternary constant-composition codes with weight three , 2000, IEEE Trans. Inf. Theory.

[10]  P. Vijay Kumar,et al.  Frequency-hopping code sequence designs having large linear span , 1988, IEEE Trans. Inf. Theory.

[11]  Ying Miao,et al.  Optimal frequency hopping sequences: a combinatorial approach , 2004, IEEE Transactions on Information Theory.

[12]  Cunsheng Ding,et al.  Algebraic Constructions of Optimal Frequency-Hopping Sequences , 2007, IEEE Transactions on Information Theory.

[13]  Charles J. Colbourn,et al.  On constant composition codes , 2006, Discret. Appl. Math..

[14]  Charles J. Colbourn,et al.  Constructions for Permutation Codes in Powerline Communications , 2004, Des. Codes Cryptogr..

[15]  Cunsheng Ding,et al.  A Construction of Optimal Constant Composition Codes , 2006, Des. Codes Cryptogr..

[16]  Chaoping Xing.  Constructions of codes from residue rings of polynomials , 2002, IEEE Trans. Inf. Theory.

[17]  John J. Komo,et al.  Maximal Length Sequences for Frequency Hopping , 1990, IEEE J. Sel. Areas Commun..

[18]  Robert A. Scholtz,et al.  The Spread Spectrum Concept , 1977, IEEE Trans. Commun..

[19]  Cunsheng Ding,et al.  Logarithm cartesian authentication codes , 2003, Inf. Comput..

[20]  Navin Kashyap,et al.  On the Design of Codes for DNA Computing , 2005, WCC.

[21]  Henning Stichtenoth,et al.  Algebraic function fields and codes , 1993, Universitext.

[22]  Gennian Ge,et al.  Further combinatorial constructions for optimal frequency-hopping sequences , 2006, J. Comb. Theory, Ser. A.

[23]  Cunsheng Ding,et al.  A family of optimal constant-composition codes , 2005, IEEE Transactions on Information Theory.

[24]  Abraham Lempel,et al.  Families of sequences with optimal Hamming-correlation properties , 1974, IEEE Trans. Inf. Theory.

[25]  Mohammad Umar Siddiqi,et al.  Optimal Large Linear Complexity Frequency Hopping Patterns Derived from Polynomial Residue Class Rings , 1998, IEEE Trans. Inf. Theory.