A surprisingly simple de Bruijn sequence construction
- 1 January 2016
- journal article
- Published by Elsevier BV in Discrete Mathematics
- Vol. 339 (1), 127-131
- https://doi.org/10.1016/j.disc.2015.08.002
Abstract
No abstract availableKeywords
Funding Information
- NSERC (400673)
This publication has 10 references indexed in Scilit:
- A Simple Combinatorial Algorithm for de Bruijn SequencesThe American Mathematical Monthly, 2010
- A new algorithm for the generation of binary de Bruijn sequencesJournal of Algorithms, 1990
- Algorithms for the generation of full-length shift- register sequencesIEEE Transactions on Information Theory, 1984
- A new memoryless algorithm for de Bruijn sequencesJournal of Algorithms, 1981
- Lexicographically least circular substringsInformation Processing Letters, 1980
- Necklaces of beads in k colors and k-ary de Bruijn sequencesDiscrete Mathematics, 1978
- Lexicographic compositions and deBruijn sequencesJournal of Combinatorial Theory, Series A, 1977
- A class of nonlinear de Bruijn cyclesJournal of Combinatorial Theory, Series A, 1975
- Generation of the ford sequence of length 2n, n largeJournal of Combinatorial Theory, Series A, 1972
- A problem in arrangementsBulletin of the American Mathematical Society, 1934