Skip to main content

De Bruijn Sequence

  • Reference work entry
Encyclopedia of Cryptography and Security
  • 441 Accesses

Related Concepts

Boolean Functions; Linear Complexity; Sequences; Maximal-Length Linear Sequences; Nonlinear Feedback Function

Definition

A k-ary de Bruijn sequence of order n is a sequence of period k n, which contains each k-ary n-tuple exactly once during each period.

Theory and Application

De Bruijn sequences are named after the Dutch mathematician Nicholas de Bruijn. In 1946, he discovered a formula giving the number of k-ary de Bruijn sequences of order n, and proved that it is given by \({((k - 1)!)}^{{k}^{n-1} } \cdot \ {k}^{{k}^{n-1}-n }\). The result was, however, first obtained more than 50 years earlier in 1894 by the French mathematician C. Flye-Sainte Marie.

For most applications, binary de Bruijn sequences are the most important. The number of binary de Bruijn sequences of period 2n is \({2}^{{2}^{n-1}-n }\). An example of a binary de Bruijn sequence of period \({2}^{4}\,=\,16\) is \(\{{s}_{t}\}\,=\,0000111101100101\). All binary 4-tuples occur exactly once during a...

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 799.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 949.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

Recommended Reading

  1. Fredricksen H (1982) A survey of full length nonlinear shift register cycle algorithms. SIAM Rev 24(2):195–221

    MATH  MathSciNet  Google Scholar 

  2. Golomb SW (1967) Shift register sequences. Holden-Day series in information systems. Holden-Day, San Francisco, Revised ed., Aegean Park Press, Laguna Hills, 1982

    Google Scholar 

  3. Golomb SW, Gong G (2005) Signal design for good correlation – for wireless communication, cryptography, and radar. Cambridge University Press, Cambridge, p 156

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this entry

Cite this entry

Helleseth, T. (2011). De Bruijn Sequence. In: van Tilborg, H.C.A., Jajodia, S. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-5906-5_344

Download citation

Publish with us

Policies and ethics