Abstract
The shortest linear recursion which generates a de Bruijn sequence is defined to be the complexity of the sequence. It is shown that the complexity of a binary de Bruijn sequence of span n is bounded by 2 n − 1 from above and 2 n − 1 + n from below. Results on the distribution of the complexities are also presented.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
