Binary linear recurrent sequences with the primitive characteristic polynomial are used as a good approximation of the random sequence. A known algorithm is implemented in a program for generation of ...
test and verify the Reed-Solomon codec. Each of these steps is important, and missing one results in developing hardware that does not work the first time and must be re-created. For example, it is ...
A polynomial parametrization for the group of integer two-by-two matrices with determinant one is given, solving an old open problem of Skolem and Beurkers. It follows that, for many Diophantine ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results