On the distribution of de Bruijn sequences of given complexity
- 1 July 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 30 (4) , 611-614
- https://doi.org/10.1109/tit.1984.1056933
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- 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