On the distribution of de bruijn sequences of low complexity
- 31 March 1985
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 38 (2) , 241-253
- https://doi.org/10.1016/0097-3165(85)90074-3
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On the distribution of de Bruijn sequences of given complexityIEEE Transactions on Information Theory, 1984
- A generalized recursive construction for de Bruijn sequencesIEEE Transactions on Information Theory, 1983
- A fast algorithm for determining the complexity of a binary sequence with period2^n(Corresp.)IEEE Transactions on Information Theory, 1983
- On the complexities of de Bruijn sequencesJournal of Combinatorial Theory, Series A, 1982
- A Survey of Full Length Nonlinear Shift Register Cycle AlgorithmsSIAM Review, 1982
- On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift RegistersIEEE Transactions on Computers, 1970