2 votes

Generate degree-bound LFSR to approximate given sequence

The measure you are interested in is usually called $k-$error linear complexity. See this review in Asiacrypt 2003 by Niederreiter. There are unpaywalled versions of this paper around. The ...
kodlu's user avatar
  • 607
1 vote

For what $N$ does $2^N$ overflow?

You don't explain how $2^N$ is calculated, so I'm assuming you repeatedly multiply by 2 (or equivalently, you repeatedly add the number to itself, or shift it left). Here's how this process looks on a ...
Yuval Filmus's user avatar

Only top scored, non community-wiki answers of a minimum length are eligible