Table of irreducible polynomials over 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
Abstract | References | Similar Articles | Additional Information
Abstract: The construction of the tables was based on linear recurring sequences over . For each degree
, the polynomials are sorted with respect to their periods. Each polynomial is listed in octal representation with period and decimation.
- [1] E. R. Berlekamp, Algebraic Coding Theory, McGraw-Hill, New York, 1968. MR 38 #6873. MR 0238597 (38:6873)
- [2]
R. W. Marsh, Table of Irreducible Polynomials over
Through Degree 19, NSA, Washington, 1957; Distributed by U.S. Dept. of Commerce, Office of Techn. Service, Washington 25, D.C.
- [3] W. W. Peterson, Error-Correcting Codes, M.I.T. Press, Cambridge, Mass.; Wiley, New York, 1961. MR 22 #12003. MR 0121260 (22:12003)
- [4] E. S. Selmer, Linear Recurrence Relations Over Finite Fields.
Retrieve articles in Mathematics of Computation with MSC: 12C05
Retrieve articles in all journals with MSC: 12C05
Additional Information
DOI:
https://doi.org/10.1090/S0025-5718-1972-0313227-5
Keywords:
Irreducible polynomals over ,
linear recurring sequences,
period
Article copyright:
© Copyright 1972
American Mathematical Society