On cyclotomic generator of order r
Information Processing Letters
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
Large families of quaternary sequences with low correlation
IEEE Transactions on Information Theory
On the linear complexity of Legendre sequences
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
On the Autocorrelation Distributions of Sidel'nikov Sequences
IEEE Transactions on Information Theory
Cross Correlation of Sidel'nikov Sequences and Their Constant Multiples
IEEE Transactions on Information Theory
New Families of -Ary Sequences With Low Correlation Constructed From Sidel'nikov Sequences
IEEE Transactions on Information Theory
An upper bound for Weil exponential sums over Galois rings and applications
IEEE Transactions on Information Theory
On the cross-correlation distributions of M-ary multiplicative character sequences
IEEE Transactions on Information Theory
On the Sidel'nikov sequences as frequency-hopping sequences
IEEE Transactions on Information Theory
Construction of unimodular sequence sets for periodic correlations
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
IEEE Transactions on Information Theory
Multiplicative characters, the weil bound, and polyphase sequence families with low correlation
IEEE Transactions on Information Theory
Construction of quaternary sequences of length pq with low autocorrelation
Cryptography and Communications
| Hi-index | 755.08 |
In this paper, we construct four M-ary sequence families from a power residue sequence of odd prime period p and its constant multiple sequences using the shift-and-add method, when M is a divisor of p - 1. We show that the maximum correlation values of the proposed sequence families are upper-bounded by 2√p+5 or 3√p+4. In addition, we prove that the linear complexity of each sequence in the proposed families is either p-1 or p-p-1/M-1. We also construct an M-ary sequence family from Sidel'nikov sequences of period pm - 1. by applying the same method, when M is a divisor of pm - 1. The proposed sequence family Fs has larger size than the known M-ary Sidel'nikov sequence families, whereas they all have the same upper bound on the maximum correlation.