Loading…
Primitive trinomials of high degree
New primitive polynomials (mod2)(\bmod 2) of high degree were found by the methods described here. The polynomials are all trinomials; such trinomials are useful for generating pseudo-random sequences of 00’s and 11’s of long length [1].
Saved in:
Published in: | Mathematics of computation 1968, Vol.22 (104), p.863-865 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | New primitive polynomials (mod2)(\bmod 2) of high degree were found by the methods described here. The polynomials are all trinomials; such trinomials are useful for generating pseudo-random sequences of 00’s and 11’s of long length [1]. |
---|---|
ISSN: | 0025-5718 1088-6842 |
DOI: | 10.1090/S0025-5718-1968-0238813-1 |