Table of irreducible polynomials over 𝐺𝐹[2] of degrees 10 through 20

Mossige, Svein

doi:10.1090/S0025-5718-1972-0313227-5

Table of irreducible polynomials over ${\rm GF}[2]$ of degrees through

Author: Svein Mossige
Journal: Math. Comp. 26 (1972), 1007-1009
MSC: Primary 12C05
DOI: https://doi.org/10.1090/S0025-5718-1972-0313227-5
MathSciNet review: 0313227
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: The construction of the tables was based on linear recurring sequences over ${\text{GF[2]}}$ . For each degree , the polynomials are sorted with respect to their periods. Each polynomial is listed in octal representation with period and decimation.

[1] Elwyn R. Berlekamp, Algebraic coding theory, McGraw-Hill Book Co., New York-Toronto, Ont.-London, 1968. MR 0238597
[2] 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.
[3] W. Wesley Peterson, Error-correcting codes, The M.I.T. Press, Cambridge, Mass.; John Wiley & Sons, Inc., New York-London, 1961. MR 0121260
[4] E. S. Selmer, Linear Recurrence Relations Over Finite Fields.

Bibliography