On the correlation of sequences
In code division multiple access applications it is necessary to find sequences with small maximum nontrivial correlation Cmax. In this paper we show that the moduli of certain character sums can be calculated in a very easy way by using a modification of a method of Sidelnikov. These results yield a very simple way to calculate Cmax for nonbinary sequences found by Kumar and Moreno and for those found by Liu and Komo.
Unable to display preview. Download preview PDF.
- P. Vijay Kumar and Oscar Moreno: Polyphase sequences with periodic correlation properties better than binary sequences. — IEEE Transactions on Information Theory (submitted).Google Scholar
- Shyh-Chang Liu and John J. Komo: Nonbinary Kasami sequences over GF(p). — IEEE Transactions on Information Theory (submitted).Google Scholar
- V.M. Sidelnikov: On mutual correlation of sequences.-Problemy Kibernetiki 24 (1971), 15–42 (in Russian).Google Scholar
- P. Solé: A quaternary cyclic code and a family of quadriphase sequences with low correlation properties. — Coding Theory and Applications (Eds. G. Cohen and J. Wolfmann), Lecture Notes in Computer Science 388, Springer-Verlag (1989), 193–201.Google Scholar