We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

Probabilistic Algorithm in Finite Fields

Thumbnail Image
Download
Name

MIT-LCS-TR-213.pdf

Size

643.84 KB

Format

Adobe PDF

Checksum (MD5)

72927b69e7aacba239f9a1e17cc1587b

Author(s)
Rabin, Michael O.
Date Issued
January 1979
Series/Report no.
MIT-LCS-TR-213
Abstract
We present probabilistic algorithms for the problems of finding an irreducible polynomial of degree n over a finite field, finding roots of a polynomial and factoring the polynomial into its irreducible factors over a finite field. All of these problems are of importance in algebraic coding theory, algebraic symbol manipulation, and number theory.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.