Factorization of polynomials over finite fields and characteristic sequences
The first author has recently introduced a new algorithm for the efficient factorization of polynomials over finite fields [Appl. Algebra Eng. Commun. Comput. 4, 81-87 (1993; Zbl 0776.11070)]. Several researchers have generalized the algorithm and suggested techniques for speeding it up. It is noted there are two techniques for generalizing the algorithm, by using either normal bases of field extensions or by applying Hasse-Teichmüller derivatives. This work considers the second techniques using derivatives and shows, in particular, that the linearization step of the general factorization algorithm using these derivatives is feasible for arbitrary finite fields. A general principle for linearizing the factorizing problem for polynomials is introduced which is derived from a certain decimation operator on sequences. The linearization using derivatives is an application of this principle.
- Factorization of a class of polynomials over finite fields
- Factoring polynomials over finite fields
- Factoring polynomials over finite fields
- Factoring polynomials over arbitrary finite fields
- scientific article; zbMATH DE number 953207
- Factoring polynomials over special finite fields
- Factorization of composite polynomials over finite fields
- Factorization of Multivariate Polynomials Over Finite Fields
- Factorization of some composite polynomials over finite fields
- Factorization of polynomials and some linear-algebra problems over finite fields
- Univariate polynomial factorization over finite fields
- The third-order factorable core of polynomials over finite fields
- Factorization of polynomials and some linear-algebra problems over finite fields
- Characterization and enumeration of good punctured polynomials over finite fields
- A new efficient factorization algorithm for polynomials over small finite fields
- A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over F₂
- Substitutions for linear shift register sequences and the factorization algorithms of Berlekamp and Niederreiter
- Factorization of composite polynomials over finite fields
- Chains of factorizations in orders of global fields
- Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers
- Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases
- scientific article; zbMATH DE number 691482 (Why is no real title available?)
- On a New Factorization Algorithm for Polynomials Over Finite Fields
- Subquadratic-time factoring of polynomials over finite fields
- The black-box Niederreiter algorithm and its implementation over the binary field
- scientific article; zbMATH DE number 6981627 (Why is no real title available?)
- On derivatives of polynomials over finite fields through integration
- Factoring polynomials over special finite fields
- Factoring polynomials over finite fields: A survey
This page was built for publication: Factorization of polynomials over finite fields and characteristic sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1322768)
