Finite fields
A Note on Sequences with the Shift and Add Property
Designs, Codes and Cryptography
Shift Register Sequences
Linear complexity of de Bruijn sequences-old and new results
IEEE Transactions on Information Theory
Linear spans of modified de Bruijn sequences
IEEE Transactions on Information Theory
Construction of de Bruijn sequences of minimal complexity
IEEE Transactions on Information Theory
Hi-index | 0.04 |
It is well known that a de Bruijn sequence over F"2 has the minimal polynomial (x+1)^d, where 2^n^-^1+n=