Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials

DOI10.1109/TIT.1983.1056666zbMath0513.12015MaRDI QIDQ3658089

Paul Camion

Publication date: 1983

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

zbMATH Keywords

algorithmidempotentfactorizationirreducible polynomialsBerlekamp algebraMcEliece operatorpolynomials of large degree

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Algorithms in computer science (68W99)

Related Items (12)

Computing Frobenius maps and factoring polynomials ⋮ Preimages of \(p\)-linearized polynomials over \(\mathbb{F}_p\) ⋮ A generalisation of the Cantor-Zassenhaus algorithm ⋮ Univariate polynomial factorization over finite fields ⋮ On the deterministic complexity of factoring polynomials over finite fields ⋮ On splitting sets in block designs and finding roots of polynomials ⋮ Factoring polynomials over finite fields: A survey ⋮ Kronecker's and Newton's approaches to solving: a first comparison ⋮ Factoring Multivariate Polynomials over Large Finite Fields ⋮ Search of primitive polynomials over finite fields ⋮ A Deterministic Algorithm for Factorizing Polynomials over Extensions GF(p^m) of GF(p), p a Small Prime ⋮ Algebraic algorithms in GF(q)

This page was built for publication: Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials