Skip to main content

Binary Sequences With Small Correlations

  • Chapter
Communications and Cryptography

Part of the book series: The Springer International Series in Engineering and Computer Science ((SECS,volume 276))

  • 280 Accesses

Abstract

Given α and β as two affine transformations on the ring of integers modulo n, define a binary ,β)sequence as a sequence S = (x 0 ,x 1 ,xn_1) that satisfies xa(i) = (-1) ixi and x β(i)= (-1) ix,. The aperiodic autocorrelation function of an (α, β) sequence is shown to satisfy a simple property. In particular, the Barker sequences of odd length are characterized as (α, β) sequences. Further (α, β) sequences of various lengths with small correlation are given.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C.E. Cook and M. BernfieldRadar SignalsNew York: Academic Press, 1967.

    Google Scholar 

  2. R.H. Barker, “Group synchronizing of binary digital systems”, inCommunication TheoryW. Jackson (ed)., pp 273–287, 1953.

    Google Scholar 

  3. J. Storer and R. Turyn, “On binary sequences” inProceedings of the American Mathematical SocietyVol. 12, pp 394–399, 1961.

    Article  MathSciNet  MATH  Google Scholar 

  4. R. Turyn, “Sequences with small correlations” inError Correcting CodesH. B. Mann (ed)., John Wiley and Sons, 1968.

    Google Scholar 

  5. J.L. Massey and J.J. Uhran, Jr., Final Report for Multi-path Study, published by the Department of Electrical Engineering of the Unversity of Notre Dame, 1969.

    Google Scholar 

  6. S.W. Golomb and R.A. Scholtz, “Generalized Barker sequences”IEEE Trans. on Information TheoryVol. IT-11, No. 4, pp 533–537, 1965.

    Article  MathSciNet  Google Scholar 

  7. M.J.E. Golay, “A class of finite binary sequences with alternate auto-correlation values equal to zero”IEEE Trans. on Information TheoryVol. IT-18, No. 3, p 449, 1972.

    Article  MATH  Google Scholar 

  8. G.E. SéguinBinary Sequences with Specified Correlation PropertiesPh.D. Dissertation, Department of Electrical Engineering, University of Notre Dame, Notre Dame, Indiana, 1971.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer Science+Business Media New York

About this chapter

Cite this chapter

Seguin, G., Drolet, G. (1994). Binary Sequences With Small Correlations. In: Blahut, R.E., Costello, D.J., Maurer, U., Mittelholzer, T. (eds) Communications and Cryptography. The Springer International Series in Engineering and Computer Science, vol 276. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2694-0_37

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-2694-0_37

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-6159-6

  • Online ISBN: 978-1-4615-2694-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics