Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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

Your Answer


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

Browse other questions tagged or ask your own question.