Back to Search
Start Over
Construction of de Bruijn sequences of minimal complexity
- Source :
- IEEE Transactions on Information Theory. 30:705-709
- Publication Year :
- 1984
- Publisher :
- Institute of Electrical and Electronics Engineers (IEEE), 1984.
-
Abstract
- It is well known that the linear complexity of a de Bruijn sequence S of length 2^{n} is bounded below by 2^{n- 1} + n for n \geq 3 . It is shown that this lower bound is attainable for all n .
Details
- ISSN :
- 00189448
- Volume :
- 30
- Database :
- OpenAIRE
- Journal :
- IEEE Transactions on Information Theory
- Accession number :
- edsair.doi...........221f4718ab480312e65ced961a47433e
- Full Text :
- https://doi.org/10.1109/tit.1984.1056965