A New Construction of Frequency-Hopping Sequences With Optimal Partial Hamming Correlation

Frequency-hopping sequences (FHSs) with favorable partial Hamming correlation properties have important applications in many synchronization and multiple-access systems. In this paper, lower bounds on the partial Hamming correlation of FHSs and FHS sets are proposed. They slightly improve the known bounds by Eun et al. and Zhou et al. A construction of FHSs and FHS sets having optimal partial Hamming correlation with respect to the improved bounds is also presented based on the theory of generalized cyclotomy. Our construction yields optimal FHSs and FHS sets with new and flexible parameters not covered in this paper.

[1]  Christine Nadel,et al.  Spread Spectrum Communications Handbook , 2016 .

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

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

[4]  Kyeongcheol Yang,et al.  On the Sidel'nikov Sequences as Frequency-Hopping Sequences , 2009, IEEE Transactions on Information Theory.

[5]  Jin-Ho Chung,et al.  New Classes of Optimal Frequency-Hopping Sequences by Interleaving Techniques , 2009, IEEE Transactions on Information Theory.

[6]  Xiaohu Tang,et al.  Optimal Frequency Hopping Sequences of Odd Length , 2013, IEEE Transactions on Information Theory.

[7]  Daiyuan Peng,et al.  New Constructions for Optimal Sets of Frequency-Hopping Sequences , 2011, IEEE Transactions on Information Theory.

[8]  Qi Wang,et al.  The linear span of the frequency hopping sequences in optimal sets , 2011, Des. Codes Cryptogr..

[9]  Solomon W. Golomb,et al.  On the nonperiodic cyclic equivalence classes of Reed-Solomon codes , 1993, 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]  Qi Wang,et al.  Optimal Sets of Frequency Hopping Sequences With Large Linear Spans , 2010, IEEE Transactions on Information Theory.

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

[13]  A. Salomaa,et al.  Chinese remainder theorem: applications in computing, coding, cryptography , 1996 .

[14]  Pingzhi Fan,et al.  New family of hopping sequences for time/frequency-hopping CDMA systems , 2005, IEEE Trans. Wirel. Commun..

[15]  Jin-Ho Chung,et al.  Optimal Frequency-Hopping Sequences With New Parameters , 2010, IEEE Transactions on Information Theory.

[16]  T. Helleseth,et al.  New Generalized Cyclotomy and Its Applications , 1998 .

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

[18]  Cunsheng Ding,et al.  Generalized Cyclotomic Codes of Length p1e1 ... ptet , 1999, IEEE Trans. Inf. Theory.

[19]  I. Reed,et al.  kth-Order Near-Orthogonal Codes (Corresp.) , 1971, IEEE Trans. Inf. Theory.

[20]  Xiaohu Tang,et al.  A Class of Optimal Frequency Hopping Sequences with New Parameters , 2012, IEEE Transactions on Information Theory.

[21]  T. Helleseth,et al.  Generalized cyclotomic codes of length p/sub 1//sup e(1)/...p/sub t//sup e(t)/ , 1999 .

[22]  Cunsheng Ding,et al.  Optimal Sets of Frequency Hopping Sequences From Linear Cyclic Codes , 2010, IEEE Transactions on Information Theory.

[23]  Daiyuan Peng,et al.  New Bound on Frequency Hopping Sequence Sets and Its Optimal Constructions , 2011, IEEE Transactions on Information Theory.

[24]  C. Ding.  Chinese remainder theorem , 1996 .

[25]  Cunsheng Ding,et al.  Sets of Optimal Frequency-Hopping Sequences , 2008, IEEE Transactions on Information Theory.

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

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

[28]  T. Apostol.  Introduction to analytic number theory , 1976 .

[29]  Jin-Ho Chung,et al.  $k$ -Fold Cyclotomy and Its Application to Frequency-Hopping Sequences , 2011, IEEE Transactions on Information Theory.

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

[31]  Masakazu Jimbo,et al.  Sets of Frequency Hopping Sequences: Bounds and Optimal Constructions , 2009, IEEE Transactions on Information Theory.

[32]  Zhengchun Zhou,et al.  New Classes of Frequency-Hopping Sequences With Optimal Partial Correlation , 2012, IEEE Transactions on Information Theory.

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

[34]  Gennian Ge,et al.  Optimal Frequency Hopping Sequences: Auto- and Cross-Correlation Properties , 2009, IEEE Trans. Inf. Theory.

[35]  Irving S Reed.  kth order near-orthogonal codes , 1971 .

[36]  Jin-Ho Chung,et al.  A New Class of Balanced Near-Perfect Nonlinear Mappings and Its Application to Sequence Design , 2013, IEEE Transactions on Information Theory.

[37]  Zhengchun Zhou,et al.  A Hybrid Incomplete Exponential Sum With Application to Aperiodic Hamming Correlation of Some Frequency-Hopping Sequences , 2012, IEEE Transactions on Information Theory.

[38]  Hong-Yeop Song,et al.  Frequency hopping sequences with optimal partial autocorrelation properties , 2004, IEEE Transactions on Information Theory.