A method for constructing decodable de Bruijn sequences

C.J. Mitchell, T. Etzion, K.G. Paterson
1996 IEEE Transactions on Information Theory  
In this paper we present two related methods of construction for de Bruijn sequences, both based on interleaving "smaller" de Bruijn sequences. Sequences obtained using these construction methods have the advantage that they can be "decoded" very efficiently, i.e., the position within the sequence of any particular "window" can be found very simply. Sequences with simple decoding algorithms are of considerable practical importance in position location applications. Index Terms-Decoding, de
more » ... s-Decoding, de Bruijn graph, window sequence, de Bruijn sequence.
doi:10.1109/18.532887 fatcat:4s572housvg7nagvr3sxlmv5ci