Advertisement

On the correlation of sequences

  • A. Tietäväinen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 573)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    P. Vijay Kumar and Chao-Ming Liu: On lower bounds to the maximum correlation of complex roots of-unity sequences.-IEEE Transactions on Information Theory 36 (1990), 633–640.CrossRefGoogle Scholar
  2. [2]
    P. Vijay Kumar and Oscar Moreno: Polyphase sequences with periodic correlation properties better than binary sequences. — IEEE Transactions on Information Theory (submitted).Google Scholar
  3. [3]
    Shyh-Chang Liu and John J. Komo: Nonbinary Kasami sequences over GF(p). — IEEE Transactions on Information Theory (submitted).Google Scholar
  4. [4]
    V.M. Sidelnikov: On mutual correlation of sequences.-Problemy Kibernetiki 24 (1971), 15–42 (in Russian).Google Scholar
  5. [5]
    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
  6. [6]
    Hannu Tarnanen: On character sums and codes.-Discrete Mathematics 57 (1985), 285–295.CrossRefGoogle Scholar
  7. [7]
    L.R. Welch: Lower bounds on the maximum correlation of signals.-IEEE Transactions on Information Theory 20 (1974), 397–399.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • A. Tietäväinen
    • 1
  1. 1.Department of MathematicsUniversity of TurkuTurkuFinland

Personalised recommendations