(Department of Mathematics, University of Manitoba)
De Bruijn Sequences
|Date||Thursday, March 14, 2019|
Abstract: De Bruijn sequences of order n are strings of 0s and 1s in which every n-bit string occurs exactly once as a consecutive subsequence. I am going to show a correspondence between de Bruijn sequences and Eulerian circuits in a class of directed graphs and a method for constructing de Bruijn sequences by using generators of finite fields.