Patterns from de Bruijn Sequences

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

For a given alphabet such as and a given length such as 5, a cyclic de Bruijn sequence like 10101110110001111100110100100000 contains the different length-5 words of that alphabet. This Demonstration uses primitive polynomials and shift register sequences to generate 150 distinct de Bruijn sequences. Each sequence is then repeatedly rotated by a multiplier to produce a pattern.

Contributed by: Ed Pegg Jr (January 2020)
Open content licensed under CC BY-NC-SA



Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.