Search for sequences with zero autocorrelation

  • Roger Alexis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 311)


It exists sequences of length N of constant amplitude and zero autocorrelation over 2n symbols, provided that each sequence be preceeded by n symbols and followed by n other symbols. Methods for obtaining these N + 2n symbols are proposed and examples are given.


Channel Impulse Response Binary Case Circular Permutation Brute Force Attack Frame Synchronization 
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]
    A. MILEWSKI "Periodic sequences with optimal properties for channel estimation and fast start up equalization". IBM J. Res. Develop. sept. 1983 pp 426–431.Google Scholar
  2. [2]
    R. POLGE et al "A new technique for the design of binary sequences with specified correlation" — IEEE Southeastcon 1981, Huntsville Alabama, pp 164–169.Google Scholar
  3. [3]
    R. POLGE "A general solution for the synthesis of binary sequences with desired correlation sequences" — AGARD conference 381 — pp. 25.1 — 25.9. Multifunction radar for airborne applications — Toulouse, Oct 85.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Roger Alexis
    • 1
  1. 1.TRTPlessis-Robinson

Personalised recommendations