Statements (26)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:combinatorics
gptkb:de_Bruijn_sequence |
| gptkbp:alphabet |
2
binary |
| gptkbp:application |
gptkb:combinatorics
coding theory cryptography |
| gptkbp:containsAllSubstringsOfLength |
n
|
| gptkbp:cycle |
true
|
| gptkbp:firstDescribed |
1946
|
| gptkbp:generation |
gptkb:de_Bruijn_graph
Lyndon word concatenation prefer-one algorithm |
| gptkbp:length |
2^n
|
| gptkbp:minimumPeriod |
2^n
|
| gptkbp:namedAfter |
gptkb:Nicolaas_Govert_de_Bruijn
|
| gptkbp:property |
every possible binary string of length n appears exactly once as a substring
|
| gptkbp:relatedTo |
gptkb:Gray_code
gptkb:Eulerian_cycle Lyndon word |
| gptkbp:usedIn |
pseudo-random number generation
shift register sequences universal cycles |
| gptkbp:bfsParent |
gptkb:de_Bruijn_sequences
|
| gptkbp:bfsLayer |
9
|
| https://www.w3.org/2000/01/rdf-schema#label |
binary de Bruijn sequence
|