A Method to Estimate Partial-Period Correlations

  • Aimo Tietäväinen


Many applications require large families of sequences with good correlation properties. Some of the best families can be constructed by means of cyclic codes. The full-period correlation of such a family is closely connected with a complete sum of additive characters. In several important special cases it can be easily estimated. On the other hand, the partial period correlations, which are connected with certain incomplete sums of additive characters, are not easy to estimate. A device for estimating is the finite Fourier transform. This approach, which in fact is a modification of an old number theoretic method due to Vinogradov, needs bounds for hybrid sums of additive and multiplicative characters. In this survey we apply this approach in three cases: the m-sequence, the set of dual-BCH sequences, and the small Kasami set.


Code Word Cyclic Code Galois Ring Linear Binary Code Number Theoretic Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    T. Helleseth and P.V. Kumar, “Sequences with low correlation”, In: Handbook of Coding Theory (eds. V.S. Pless, R.A. Brualdi and W. C. Huffman), to appear.Google Scholar
  2. [2]
    I. Honkala and A. Tietäväinen, “Codes and number theory”, In: Handbook of Coding Theory (eds. V.S. Pless, R.A. Brualdi and W. C. Huffman), to appear.Google Scholar
  3. [3]
    S. Koponen and J. Lahtonen, “On the aperiodic and odd correlations of the binary Shanbhag-Kumar-Helleseth sequences”, IEEE Trans. Information Theory, 43, 1997, 1593–1596.MathSciNetzbMATHCrossRefGoogle Scholar
  4. [4]
    J. Lahtonen. “On the odd and the aperiodic correlation properties of the Kasami sequences”, IEEE Trans. Information Theory, 41, 1995, 1506 1508.Google Scholar
  5. [5]
    J. Lahtonen, “Examples of small hybrid sums”, London Mathematical Society, Lecture Notes, Series 233, 1996, 155–161.MathSciNetGoogle Scholar
  6. [6]
    R. Lidl and H. Niederreiter, Finite Fields, Addison-Wesley, 1983.Google Scholar
  7. [7]
    S. Litsyn and A. Tietäväinen, “Character sum constructions of constrained error-correcting codes”, Appl. Algebra in Engineering, Communication and Computing, 5, 1994, 45–51.zbMATHGoogle Scholar
  8. [8]
    R.J. McEliece, “Correlation properties of sets of sequences derived from irreducible cyclic codes”, Information and Control, 45, 1980, 18–25.MathSciNetzbMATHCrossRefGoogle Scholar
  9. [9]
    D.V. Sarwate, “An upper bound on the aperiodic autocorrelation function for a maximal-length sequence”, IEEE Trans. Information Theory, 30, 1984, 685–687.MathSciNetzbMATHCrossRefGoogle Scholar
  10. [10]
    A.G. Shanbhag, P.V. Kumar and T. Helleseth, “An upper bound for the aperiodic correlation of weighted-degree CDMA sequences”, Proc. of the 1995 IEEE International Symposium on Information Theory, 1995, 92.Google Scholar
  11. [11]
    I.M. Vinogradov, Elements of Number Theory, Dover, 1954.Google Scholar
  12. [12]
    A. Weil, “Sur les courbes algébriques et les veriétés qui s’en déduisent”, Actualités Sci. Ind., no. 1041, Hermann, Paris, 1948.Google Scholar

Copyright information

© Springer Science+Business Media New York 2000

Authors and Affiliations

  • Aimo Tietäväinen
    • 1
  1. 1.Department of Mathematics and TUCSUniversity of TurkuTurkuFinland

Personalised recommendations