Answer by bmm6o for Majority-based feedback shift register
I've written some code to just brute force tap configurations and starting values for small register sizes. So I have some values, rather than an analytic result. Of course the results are conditional...
View ArticleAnswer by fgrieu for Majority-based feedback shift register
I'm reading the question as asking for $b(n)$, the largest possible, such that we can exhibit distinct tap points (in odd number), and $n$-bit state, leading to a periodic sequence of (shortest) period...
View ArticleAnswer by Daniel S for Majority-based feedback shift register
I would hesitate to claim a better lower bound than 1.We note that for a majority vote feedback shift register (hereafter MVFSR) if there are $2k+1$ taps and if at any point the fill of the register...
View ArticleMajority-based feedback shift register
Linear feedback shift registers (LFSR's) work by taking a fixed-length bit-string $b\in\{0,1\}^n$, as well as fixed "taps" (bit positions) and applying XOR to the taps, giving one output bit, which is...
View Article
