Frequency-hopping code sequence designs having large linear span
IEEE Transactions on Information Theory
Finite fields
Further combinatorial constructions for optimal frequency-hopping sequences
Journal of Combinatorial Theory Series A - Special issue in honor of Jacobus H. van Lint
Lower bounds on the Hamming auto- and cross correlations of frequency-hopping sequences
IEEE Transactions on Information Theory
Optimal frequency hopping sequences: a combinatorial approach
IEEE Transactions on Information Theory
Optimal frequency-hopping sequences via cyclotomy
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Algebraic Constructions of Optimal Frequency-Hopping Sequences
IEEE Transactions on Information Theory
New classes of optimal frequency-hopping sequences by interleaving techniques
IEEE Transactions on Information Theory
Optimal frequency-hopping sequences with new parameters
IEEE Transactions on Information Theory
Optimal sets of frequency hopping sequences with large linear spans
IEEE Transactions on Information Theory
Combinatorial Designs for Authentication and Secrecy Codes
Foundations and Trends in Communications and Information Theory
Optimal sets of frequency hopping sequences from linear cyclic codes
IEEE Transactions on Information Theory
SETA'10 Proceedings of the 6th international conference on Sequences and their applications
New designs of frequency hopping sequences with low hit zone
Designs, Codes and Cryptography
The linear span of the frequency hopping sequences in optimal sets
Designs, Codes and Cryptography
On the aperiodic hamming correlation of frequency-hopping sequences from norm functions
SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications
A new frequency-hopping sequence set based upon generalized cyclotomy
Designs, Codes and Cryptography
Hi-index | 755.08 |
Frequency hopping (FH) sequences play a key role in frequency hopping spread spectrum communication systems. In order to evaluate the performance of FH sequences, Lempel and Greenberger (1974) and Peng and Fan (2004) derived lower bounds on their Hamming auto- and cross-correlations. In this paper, we construct families of FH sequences with Hamming correlations meeting those bounds by combinatorial and algebraic techniques. We first construct optimal families consisting of a single FH sequence with maximum Hamming correlation equal to 2 from a combinatorial approach. Then we investigate families consisting of multiple FH sequences. We provide a combinatorial characterization for such families, and present a recursive method to construct them by means of this characterization. We also describe two algebraic constructions for such families of FH sequences, generalizing those of Ding, Moisio, and Yuan (2007). As a consequence, many new optimal families of FH sequences are obtained.