Berlekamp's algorithm is a well known method in computational algebra for factoring polynomials over finite fields, invented by Elwyn Berlekamp in 1967. It works mainly through matrix reduction combined with polynomial greatest-common-divisor computations, and it remained the dominant algorithm for the problem until the Cantor-Zassenhaus algorithm was introduced in 1981. It is still implemented in many well known computer algebra systems today.
Connections
In Field
Source Wikipedia: Berlekamp's algorithm
Uses Design Technique
Source Wikipedia: Berlekamp's algorithm
Sources
Wikipedia: Berlekamp's algorithm
Lead section
In mathematics, particularly computational algebra, Berlekamp's algorithm is a well-known method for factoring polynomials over finite fields (also known as Galois fields).
Uses Design Technique: Recursion, Article body
The algorithm may then be applied recursively to these and subsequent divisors, until we find the decomposition of f ( x ) {\displaystyle f(x)} into powers of irreducible polynomials (recalling that the ring of polynomials over a finite field is a unique factorization domain).
In Field: Computer Algebra, Lead sentence
Berlekamp's algorithm is a well-known method for factoring polynomials over finite fields (also known as Galois fields).
View the SourceWikidata: Berlekamp's algorithm
Wikidata Q821001, class allow-list match (w-wdresolver-0926)View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.