A method for constructing decodable de Bruijn sequences

  • Authors:
  • C. J. Mitchell;T. Etzion;K. G. Paterson

  • Affiliations:
  • Dept. of Comput. Sci., London Univ.;-;-

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2006

Quantified Score

Hi-index 754.84

Visualization

Abstract

We present two related methods of construction for de Bruijn (1946) 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