Primitive Binary Polynomials
- 1 October 1973
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 27 (124) , 977-980
- https://doi.org/10.2307/2005535
Abstract
One primitive polynomial modulo two is listed for each degree n through $n = 168$. Each polynomial has the minimum number of terms possible for its degree. The method used to generate the list is described.
Keywords
This publication has 3 references indexed in Scilit:
- Algebraic Coding TheoryPublished by World Scientific Pub Co Pte Ltd ,2014
- Shift Register SequencesPublished by World Scientific Pub Co Pte Ltd ,2014
- En Bok om PrimtalMathematics of Computation, 1971