![]() That one is handy for software implementations, for the representation of the polynomials can be compressed into a small bitmask. ![]() Reference is given to: Janusz Rajski et Jerzy Tyszer, Primitive Polynomials Over GF(2) of Degree up to 660 with Uniformly Distributed Coefficients, which free main table there (part 1, 2 3).įurther, highbit-normalprimpoly gives one primitive polynomial per degree up to 400, selected has having the lowest non-constant term as high as possible. In particular, all-trinomial-primpoly gives primitive GF(2) trinomials (LFSR with 2 taps, the minimum number) to degree 400. ![]() ![]() When I need something on that tune I might use Jörg's useful and ugly page of mathematical data. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |