Construction of de Bruijn sequences of minimal complexity
- 1 September 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 30 (5) , 705-709
- https://doi.org/10.1109/tit.1984.1056965
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- On the distribution of de bruijn sequences of low complexityJournal of Combinatorial Theory, Series A, 1985
- 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
- The Theory of Autonomous Linear Sequential NetworksIRE Transactions on Circuit Theory, 1959