A linear-recursive-sequence (LRS) generator produces binary sequences using a shift register and feedback through an exclusive-OR gate. The sequence length equals 2 N 1, where N represents the number ...
The best possible integer un such that fun = 1, if f is an invertible n × n matrix with coefficients in a Boolean ring, is determined. The period of linear recursive sequences in a Boolean ring (e.g.
An aptitude for mentally stringing together related items, often cited as a hallmark of human language, may have deep roots in primate evolution, a new study suggests. But “this work shows that the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback