Table of irreducible polynomials over $\textrm {GF}[2]$ of degrees $10$ through $20$
HTML articles powered by AMS MathViewer
- by Svein Mossige PDF
- Math. Comp. 26 (1972), 1007-1009 Request permission
Abstract:
The construction of the tables was based on linear recurring sequences over ${\text {GF[2]}}$. For each degree $n$, the polynomials are sorted with respect to their periods. Each polynomial is listed in octal representation with period and decimation.References
- Elwyn R. Berlekamp, Algebraic coding theory, McGraw-Hill Book Co., New York-Toronto, Ont.-London, 1968. MR 0238597 R. W. Marsh, Table of Irreducible Polynomials over ${\text {GF}}[{\text {2}}]$ Through Degree 19, NSA, Washington, 1957; Distributed by U.S. Dept. of Commerce, Office of Techn. Service, Washington 25, D.C.
- W. Wesley Peterson, Error-correcting codes, The M.I.T. Press, Cambridge, Mass.; John Wiley & Sons, Inc., New York-London, 1961. MR 0121260 E. S. Selmer, Linear Recurrence Relations Over Finite Fields.
Additional Information
- © Copyright 1972 American Mathematical Society
- Journal: Math. Comp. 26 (1972), 1007-1009
- MSC: Primary 12C05
- DOI: https://doi.org/10.1090/S0025-5718-1972-0313227-5
- MathSciNet review: 0313227