A class of optimal frequency hopping sequences based on the decimated m-sequences
Preprint
- 24 January 2023
- preprint
- Published by Springer Nature in Research Square
Abstract
In frequency hopping communication system, the correlation characteristic of frequency hopping sequence is an important standard to measure the system performance. Therefore, the design of new frequency hopping sequences with low correlation property has always been one of the important topics in frequency hopping systems. In this paper, we present a class of frequency hopping sequences with respect to the Lempel-Greenberger bound, which is based on the character sums over finite fields and the decimation of m-sequences. The parameters of this frequency hopping sequences are new. Mathematics Subject Classification: 11B50, 11B65, 11B83.Keywords
All Related Versions
This publication has 21 references indexed in Scilit:
- More Optimal Difference Systems of Sets and Frequency-Hopping Sequences From Zero-Difference FunctionsIEEE Access, 2019
- Recursive construction of optimal frequency‐hopping sequence setsIET Communications, 2016
- Algebraic Constructions of Optimal Frequency-Hopping SequencesIEEE Transactions on Information Theory, 2007
- Further combinatorial constructions for optimal frequency-hopping sequencesJournal of Combinatorial Theory, Series A, 2006
- Optimal Frequency-Hopping Sequences Via CyclotomyIEEE Transactions on Information Theory, 2005
- Optimal Frequency Hopping Sequences: A Combinatorial ApproachIEEE Transactions on Information Theory, 2004
- Optimal large linear complexity frequency hopping patterns derived from polynomial residue class ringsIEEE Transactions on Information Theory, 1998
- Maximal length sequences for frequency hoppingIEEE Journal on Selected Areas in Communications, 1990
- 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