A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- 1 April 1982
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in Siam Review
- Vol. 24 (2), 195-221
- https://doi.org/10.1137/1024041
Abstract
No abstract availableThis publication has 31 references indexed in Scilit:
- On the complexities of de Bruijn sequencesJournal of Combinatorial Theory, Series A, 1982
- 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
- The lexicographically least de Bruijn cycleJournal of Combinatorial Theory, 1970
- The Number of Circular Patterns Compatible with a Pseudo-Symmetric Connected GraphCanadian Journal of Mathematics, 1966
- Exact Markov Probabilities from Oriented Linear GraphsThe Annals of Mathematical Statistics, 1957
- Normal Recurring DecimalsJournal of the London Mathematical Society, 1946
- Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wirdAnnalen der Physik, 1847