Editing De Bruijn sequence (section)

==de Bruijn decoding==
Computing the position of a particular unique tuple or matrix in a de Bruijn sequence or torus is known as the ''de Bruijn decoding problem''. Efficient [[Analysis of algorithms|{{tmath|\color{Blue} O(n \log n)}}]] decoding algorithms exist for special, recursively constructed sequences{{sfnp|Tuliani|2001}} and extend to the two-dimensional case.{{sfnp|Hurlbert|Isaak|1993}} de Bruijn decoding is of interest, e.g., in cases where large sequences or tori are used for positional encoding.