Designs, Codes and Cryptography

, Volume 16, Issue 3, pp 249–256

On The Correlation Of Binary M-sequences

  • John Friedlander
  • Michael Larsen
  • Daniel Lieman
  • Igor Shparlinski
Article

DOI: 10.1023/A:1008383811226

Cite this article as:
Friedlander, J., Larsen, M., Lieman, D. et al. Designs, Codes and Cryptography (1999) 16: 249. doi:10.1023/A:1008383811226

Abstract

We obtain the upper bound O(214n/15 n−1/5) on the number of distinct values of all possible correlation functions between M-sequences of order n .

M-sequences and correlation functions

Copyright information

© Kluwer Academic Publishers 1999

Authors and Affiliations

  • John Friedlander
    • 1
  • Michael Larsen
    • 2
  • Daniel Lieman
    • 2
  • Igor Shparlinski
    • 3
  1. 1.Department of MathematicsUniversity of TorontoTorontoCanada
  2. 2.Department of MathematicsUniversity of MissouriColumbiaUSA
  3. 3.School of MPCEMacquarie UniversitySydneyAustralia