De Bruijn sequence of order of -sized alphabet (simplest case is binary) is a cycle sequence in which every possible -length string on A occurs exactly once as a substring. Such a sequence is denoted and has length
In order to build such a sequence, one has to take an Euler cycle in an dimensional De Bruijn graph, i.e. for