A class of nonlinear de Bruijn cycles
- 30 September 1975
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 19 (2), 192-199
- https://doi.org/10.1016/s0097-3165(75)80007-0
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Generating and Counting the Double Adjacencies in a Pure Circulating Shift RegisterIEEE Transactions on Computers, 1975
- Double Adjacencies Between Cycles of a Circulating Shift RegisterIEEE Transactions on Computers, 1973
- Generation of the ford sequence of length 2n, n largeJournal of Combinatorial Theory, Series A, 1972
- Constructive theorems for the truth table of the ford sequenceJournal of Combinatorial Theory, Series A, 1971
- On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift RegistersIEEE Transactions on Computers, 1970
- The lexicographically least de Bruijn cycleJournal of Combinatorial Theory, 1970
- Relations Between Pn Cycles and Stable Feedback Shift RegistersIEEE Transactions on Electronic Computers, 1966
- Normal Recurring DecimalsJournal of the London Mathematical Society, 1946
- Note on a Paper By I. J. GoodJournal of the London Mathematical Society, 1946
- A problem in arrangementsBulletin of the American Mathematical Society, 1934