Skip to main content
SpringerLink
Log in
Book cover

International Conference on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes

AAECC 1987: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes pp 25–34Cite as

Searching for weakly autocorrelated binary sequences

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 356))

Abstract

Exhaustive search for minimally autocorrelated binary sequences has not met any conclusive answer yet. We present here a new algorithm which allows us to obtain in a reasonable time results for heretofore unreachable values.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barker R. H., Group synchronizing of binary digital systems, in Communication theory, Jackson, W, Ed., Butterworth, London, 1953, 273–287.

    Google Scholar 

  2. Lindner J., Binary sequences up to length 40 with best possible autocorrelation function. Electronics letters, 11, (1975), 507.

    Google Scholar 

  3. Robin G., Suites binaires bien autocorrélées, Annales des télécommunications, tome 39, no 7–8, Juillet-Août 1984.

    Google Scholar 

  4. Turyn R. and Storer J., On binary sequences, Proc. Amer. Math. Soc. 12 (1961) 394–399.

    Google Scholar 

  5. Turyn R, Sequences with small correlation in Mann H. Ed. Error correcting codes, Wiley, New York (1969), 195–228.

    Google Scholar 

  6. Golay M.J.E., IEEE Trans. Inf. Theory, IT-23, 43, 1977.

    Google Scholar 

  7. Golay M.J.E., IEEE Trans. Inf. Theory, IT-28, 543, 1982

    Google Scholar 

  8. Golay M.J.E., IEEE Trans. Inf. Theory, IT-29, 934, 1983

    Google Scholar 

  9. Bernasconi J., J. Physique 48 (1987) 559–567.

    Google Scholar 

  10. Saffari, Smith, CRAS 306, Série I, p 695–698, 1988.

    Google Scholar 

  11. Sarwate D.V., Pursley M.B., Proc. of the IEEE Vol 68, 593–619, 1980.

    Google Scholar 

  12. Jensen H.E., Hoholdt T., Binary Sequences with Good Correlation, This conference.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département d'informatique I.U.T. A, Université de Bordeaux I, 33405, Talence Cedex

    Michel Bauderon

  2. Département de Mathématiques, Faculté des Sciences de Limoges, 123, Avenue Albert Thomas, 87060, Limoges Cedex

    François Laubie

Authors
  1. Michel Bauderon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. François Laubie
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Llorenç Huguet Alain Poli

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bauderon, M., Laubie, F. (1989). Searching for weakly autocorrelated binary sequences. In: Huguet, L., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1987. Lecture Notes in Computer Science, vol 356. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51082-6_67

Download citation

  • DOI: https://doi.org/10.1007/3-540-51082-6_67

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51082-6

  • Online ISBN: 978-3-540-46150-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation