Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. MILEWSKI "Periodic sequences with optimal properties for channel estimation and fast start up equalization". IBM J. Res. Develop. sept. 1983 pp 426–431.
R. POLGE et al "A new technique for the design of binary sequences with specified correlation" — IEEE Southeastcon 1981, Huntsville Alabama, pp 164–169.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alexis, R. (1988). Search for sequences with zero autocorrelation. In: Cohen, G., Godlewski, P. (eds) Coding Theory and Applications. Coding Theory 1986. Lecture Notes in Computer Science, vol 311. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19368-5_18
Download citation
DOI: https://doi.org/10.1007/3-540-19368-5_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19368-5
Online ISBN: 978-3-540-39243-9
eBook Packages: Springer Book Archive