Take the 2-minute tour ×
Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It's 100% free, no registration required.

Recently i'm reading "Cryptographically Strong de Bruijn Sequences with Large Periods" . In the section 2 2.1 Basic Denitions and Properties , property 1 says that $$2n<LS_s\leq2^n-2$$ The author claims that this bound comes from "Characterizations of Generators for Modified de Bruijn Sequences". I go through it, but i never find this bound in it.

I wonder how this bound comes? Can someone prove it? Or does someone know some related paper about it? thanks ..

share|improve this question
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.