Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



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

Author: Svein Mossige
Journal: Math. Comp. 26 (1972), 1007-1009
MSC: Primary 12C05
MathSciNet review: 0313227
Full-text PDF

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 $ n$, the polynomials are sorted with respect to their periods. Each polynomial is listed in octal representation with period and decimation.

References [Enhancements On Off] (What's this?)

  • [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.

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 12C05

Retrieve articles in all journals with MSC: 12C05

Additional Information

Keywords: Irreducible polynomals over $ {\text{GF[2]}}$, linear recurring sequences, period
Article copyright: © Copyright 1972 American Mathematical Society

American Mathematical Society