Skip to main content
Log in

A note on the nonexistence of Barker sequences

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

A Barker sequence is a sequence with elements ±1 such that all out-of-phase aperiodic autocorrelation coefficients are 0, 1 or -1. It is known that if a Barker sequence of length s > 13 exists then s = 4N 2 for some odd integer N ≥ 55, and it has long been conjectured that no such sequence exists. We review some previous attempts to improve the bound on N which, unfortunately, contain errors. We show that a recent theorem of Eliahou et al. [5] rules out all but six values of N less than 5000, the smallest of which is 689.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. K.T. Arasu and A. Pott, A note on a paper on Barker sequences. Preprint.

  2. R.H. Barker, Group synchronizing of binary digital systems, In W. Jackson, editor, Communication Theory, Academic Press, New York, 1953, pp. 273–287.

    Google Scholar 

  3. L.D. Baumert, Cyclic Difference Sets, Lecture Notes in Mathematics 182, Springer-Verlag, New York, 1971.

    Google Scholar 

  4. M. Elia, On the non-existence of Barker sequences, Combinatorica vol. 6, pp. 275–278, 1986.

    Google Scholar 

  5. S. Eliahou, M. Kervaire, and B. Saffari, A new restriction on the lengths of Golay complementary sequences, J. Combin. Theory (A) vol. 55, pp. 49–59, 1990.

    Google Scholar 

  6. M.L. Fredman, B. Saffari, and B. Smith, Polynômes réciproques: conjecture d'Erdös en norme L4, taille des autocorrélations et inexistence des codes de Barker, C.R. Acad. Sci. Paris vol. 308 Serié I, pp. 461–464, 1989.

    Google Scholar 

  7. T. Høholdt. Personal communication, January 1990.

  8. C. Mitchell, Comment on “Existence of one-dimensional perfect binary arrays,” Electron. Lett. vol. 24, p. 714, 1988.

    Google Scholar 

  9. B.V. Rao and A.A. Deshpande, Why the Barker sequence bit length does not exceed thirteen?, J. Inst. Electron. Telecommun. Eng. (India) vol 34, pp. 461–462, 1988.

    Google Scholar 

  10. H.J. Ryser, Combinatorial Mathematics, Carus Mathematical Monographs No. 14, Mathematical Association of America, Washington, DC, 1963.

    Google Scholar 

  11. B. Saffari and B. Smith, Inexistence de polynômes ultra-plats de Kahane à coefficients ±1. Preuve de la conjecture d'Erdös, C.R. Acad. Sci. Paris vol. 306 Serié I, pp. 695–698, 1988.

    Google Scholar 

  12. R. Turyn and J. Storer, On binary sequences, Proc. Amer. Math. Soc. vol. 12, pp. 394–399, 1961.

    Google Scholar 

  13. R.J. Turyn, Character sums and difference sets, Pacific J. Math. vol. 15, pp. 319–346, 1965.

    Google Scholar 

  14. R.J. Turyn, Sequences with small correlation, In H.B. Mann, editor, Error Correcting Codes, Wiley, New York 1968, pp. 195–228.

    Google Scholar 

  15. Y.Y. Xian, Existence of one-dimensional perfect binary arrays, Electron. Lett. vol. 23, pp. 1277–1278, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by D. Jungnickel

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jedwab, J., Lloyd, S. A note on the nonexistence of Barker sequences. Des Codes Crypt 2, 93–97 (1992). https://doi.org/10.1007/BF00124212

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation