Berlekamp's algorithm
Builds on Finite fieldMonic polynomialPolynomial greatest common divisorNull spaceChinese remainder theorem for rings
Definition
Let be the finite field with elements and let be a monic square-free polynomial of degree . Let be the -vector space of polynomials of degree less than . The Berlekamp subalgebra of is Berlekamp's algorithm factors as follows.
- Compute the matrix of the -linear map , , and a basis of as the null space of .
- If , then is irreducible.
- Otherwise take of positive degree; then , and at least two of these factors have positive degree.
- Apply step 3 to the factors, with other elements of , until there are factors.
Remarks
By the Chinese remainder theorem, , where is the number of irreducible factors of , so . Step 3 holds because and divides ; the factors are pairwise coprime, and none of them is divisible by . Example: over ; since , has dimension , and gives and . Non-example: over ; since , , so is the constants, , and is irreducible. The algorithm needs square-free; a repeated factor is first removed with . The running time is polynomial in and , so it suits small fields; for large randomised variants are used.
Reading path
To understand this page from the ground up, read these 31 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Group concept
- Matrix definition
- Vector space definition
- Ring definition
- Linear map definition
- Commutative ring definition
- Ideal definition
- Polynomial ring definition
- Product of rings definition
- Ring homomorphism definition
- Unit of a ring definition
- Zero divisor definition
- Kernel of a linear map definition
- Divisibility in a commutative ring definition
- Sum of ideals concept
- Two-sided ideal definition
- Degree of a polynomial definition
- Field definition
- Integral domain definition
- Null space definition
- Ring isomorphism definition
- Coprime ideals definition
- Quotient ring definition
- Associate elements definition
- Leading coefficient definition
- Finite field definition
- Greatest common divisor in an integral domain definition
- Chinese remainder theorem for rings statement
- Monic polynomial definition
- Polynomial greatest common divisor definition
- Berlekamp's algorithm definition
Further reading
About this page
| Tag | HJW1KSQZWA |
|---|---|
| URI | m2://HJW1KSQZWA |
| Kind | definition |
| Writing | W0 stub |
| MSC | 11T06, 11Y16, 68W30 |
| Defines | Berlekamp's algorithm |
| Uses | Finite field, Monic polynomial, Polynomial greatest common divisor, Null space, Chinese remainder theorem for rings |
| Changed | 2 November 2026 |
Markdown Β· JSON Β· Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.