Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
De Bruijn sequence
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==f-fold de Bruijn sequences== An '''f-fold n-ary de Bruijn sequence''' is an extension of the notion ''n''-ary de Bruijn sequence, such that the sequence of the length <math>fk^n</math> contains every possible [[subsequence]] of the length ''n'' exactly ''f'' times. For example, for <math>n=2</math> the cyclic sequences 11100010 and 11101000 are two-fold binary de Bruijn sequences. The number of two-fold de Bruijn sequences, <math>N_n</math> for <math>n=1</math> is <math>N_1=2</math>, the other known numbers{{sfnp|Osipov|2016}} are <math>N_2=5</math>, <math>N_3=72</math>, and <math>N_4=43768</math>.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)