Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4624672 | Advances in Applied Mathematics | 2015 | 4 Pages |
Abstract
Fredricksen and Maiorana (1978) [2] prove that the concatenation of Lyndon words of length dividing n in lexicographic order produces a de Bruijn sequence of span n, and they state that this word is lexicographically minimal among all de Bruijn sequences of span n. An alternative proof was presented in Moreno (2004) [4]. The purpose of this corrigendum is twofold. We give a complete proof, clarifying some ambiguities of the previous proof. Additionally, we include a proof of the minimality of the de Bruijn sequence obtained in this way.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Eduardo Moreno, Dominique Perrin,