Recursive construction of optimal frequency‐hopping sequence sets
Authors:
Open Access
- 1 June 2016
- journal article
- research article
- Published by Institution of Engineering and Technology (IET) in IET Communications
- Vol. 10 (9) , 1080-1086
Abstract
In this study, first the authors present a simplified representation of the Peng–Fan bounds on the periodic Hamming correlation of frequency‐hopping sequence (FHS) sets, which may also be used to check the optimality of an FHS set with respect to the Peng–Fan bounds. Second, they propose a recursive construction of FHS sets from the known ones using some injective functions and the Chinese remainder theorem. It generalises the previous construction of optimal FHSs and FHS sets with composite lengths employing a given function. Without the limit of the specific function, their construction can produce new optimal FHSs and FHS sets that cannot be produced by the earlier construction. By choosing appropriate injective functions and known optimal FHSs and FHS sets, infinitely many new optimal FHSs and FHS sets can be recursively obtained.Keywords
Funding Information
- Graduate Research and Innovation Projects of Jiangsu Province (KYZZ15_0090)
- Fundamental Research Funds for the Central Universities
This publication has 26 references indexed in Scilit:
- New sets of frequency-hopping sequences with optimal Hamming correlationDesigns, Codes and Cryptography, 2012
- New frequency-hopping sequence sets with optimal average and good maximum Hamming correlationsIET Communications, 2012
- A new frequency-hopping sequence set based upon generalized cyclotomyDesigns, Codes and Cryptography, 2012
- Average Hamming correlation for the cubic polynomial hopping sequencesIET Communications, 2010
- Optimal Frequency-Hopping Sequences Via CyclotomyIEEE Transactions on Information Theory, 2005
- Generalised class of cubic frequency-hopping sequences with large family sizeIEE Proceedings - Communications, 2005
- Optimal Frequency Hopping Sequences: A Combinatorial ApproachIEEE Transactions on Information Theory, 2004
- Lower Bounds on the Hamming Auto- and Cross Correlations of Frequency-Hopping SequencesIEEE Transactions on Information Theory, 2004
- Frequency-hopping code sequence designs having large linear spanIEEE Transactions on Information Theory, 1988
- Families of sequences with optimal Hamming-correlation propertiesIEEE Transactions on Information Theory, 1974