A new algorithm for the generation of binary de Bruijn sequences
- 31 March 1990
- journal article
- Published by Elsevier BV in Journal of Algorithms
- Vol. 11 (1), 44-51
- https://doi.org/10.1016/0196-6774(90)90028-d
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Notes on de Bruijn sequencesDiscrete Applied Mathematics, 1987
- Algorithms for the generation of full-length shift- register sequencesIEEE Transactions on Information Theory, 1984
- A Survey of Full Length Nonlinear Shift Register Cycle AlgorithmsSIAM Review, 1982
- A new memoryless algorithm for de Bruijn sequencesJournal of Algorithms, 1981
- Necklaces of beads in k colors and k-ary de Bruijn sequencesDiscrete Mathematics, 1978
- 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