Construction of Sequences for Multi-group FH-FDMA in DRT System
ICOIN '02 Revised Papers from the International Conference on Information Networking, Wireless Communications Technologies and Network Applications-Part II
New optimal quadriphase sequences with larger linear span
IEEE Transactions on Information Theory
Sets of frequency hopping sequences: bounds and optimal constructions
IEEE Transactions on Information Theory
On the Sidel'nikov sequences as 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
Optimal sets of frequency hopping sequences from linear cyclic codes
IEEE Transactions on Information Theory
Cyclic codes over R=Fp+uFp+...+uk-1Fp with length psn
Information Sciences: an International Journal
The linear span of the frequency hopping sequences in optimal sets
Designs, Codes and Cryptography
Low-Hit-Zone frequency-hopping sequence sets with new parameters
SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications
| Hi-index | 755.26 |
We construct new sequences over finite rings having optimal Hamming correlation properties. These sequences are useful in frequency hopping multiple-access (FHMA) spread-spectrum communication systems. Our constructions can be classified into linear and nonlinear categories, both giving optimal Hamming correlations according to Lempel-Greenberger (1974) bound. The nonlinear sequences have large linear complexity and can be seen as a generalized version of GMW sequences over fields