Skip to main content
SpringerLink
Log in

A simple method to estimate the maximum nontrivial correlation of some sets of sequences

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract

Code division multiple access and many other applications require large families of sequences with good correlation properties. In this paper we show that the moduli of certain character sums can be estimated in an easy way by using a method of Sidelnikov. These results yield a simple method to estimate the maximum nontrivial correlations of several well-known sets of sequences.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Berlekamp, E. R.: Key papers in the Development of Coding Theory. IEEE Press 1974

  2. Gold, R.: Optimal binary sequences for spread spectrum multiplexing. IEEE Trans. Inform. Theory13, 619–621 (1967)

    Google Scholar 

  3. Kasami, T.: Weight distribution of Bose-Chadhury-Hocquenghem codes. Proc. Conf. Combinatorial Mathematics and Its Applications, Chapel Hill, N. C.: University of North Carolina Press 1968

    Google Scholar 

  4. MacWilliams, F. J., Sloane, N. J. A.: The Theory of Error-Correcting Codes, North-Holland 1977

  5. Massey, J. L., Uhran, J. J., Jr.: Final report for multipath study. Contract NAS 5-10786, Univ. Notre Dame 1969

  6. McEliece, R. J.: Finite Fields for Computer Scientists and Engineers. Kluwer 1987

  7. Sarwate, D. V., Pursley, M. B.: Correlation properties of pseudorandom and related sequences. Proc. IEEE68, 593–619 (1980)

    Google Scholar 

  8. Sidelnikov, V. M.: On mutual correlation of sequences. Problemy Kibernitiki24, 15–42 (1971) (in Russian)

    Google Scholar 

  9. Tietäväinen, A.: On the correlation of sequences. In: G. Cohen, S. Litsyn, A. Lobstein, G. Zémor (eds.), Algebraic Coding. Lecture Notes in Computer Science vol.573, pp. 1–4. Berlin, Heidelberg, New York: Springer 1991

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, Telecommunication Laboratory, University of Oulu, Linnanmaa S1, SF-90570, Oulu, Finland

    Hannu Tarnanen

  2. Department of Mathematics, University of Turku, SF-20500, Turku, Finland

    Aimo Tietäväinen

Authors
  1. Hannu Tarnanen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aimo Tietäväinen
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Supported by the Technology Development Center of Finland, Elektrobit Company, Finnish Air Force, Nokia Mobile Phones Inc. and Nokia Cellular Systems Inc.

Partially supported by the Academy of Finland

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tarnanen, H., Tietäväinen, A. A simple method to estimate the maximum nontrivial correlation of some sets of sequences. AAECC 5, 123–128 (1994). https://doi.org/10.1007/BF01438281

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01438281

Keywords

Search

Navigation