Factorization of polynomials and some linear-algebra problems over finite fields
A variety of problems which can be reduced to linear algebraic problems over finite fields are considered. The classical method for factoring a polynomial over a finite field, and the more recent method of the author [Appl. Algebra Eng. Commun. Comput. 4, 81-87 (1993; Zbl 0776.11070)], which makes use of the Hasse-Teichmüller derivative and differential equations, are considered. In particular, the range of applicability of this last method, originally restricted to prime fields, is extended to arbitrary finite fields. Other properties and extensions are given. The problem of pseudorandom vector generation over finite fields, of importance for parallelized simulation methods, is discussed. In particular, a previous method of the author is extended from prime to arbitrary finite fields. As a generalization of the matrix method of this problem, a multiple-recursive matrix method is introduced and used for the generation of pseudorandom numbers. Finally, a combinatorial problem for vector spaces over finite fields, concerning the linear independence of subsets of vectors chosen from a given set, is considered. The problem can be considered a generalization of a classical problem of linear block codes and is also connected with the theory of uniform point distributions in unit cubes. Several open problems are noted in connection with each of the areas discussed.
- Computational problems in the theory of finite fields
- Factorization of polynomials over finite fields and characteristic sequences
- scientific article; zbMATH DE number 4198135
- scientific article; zbMATH DE number 3861283
- scientific article; zbMATH DE number 19618
- Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases
- scientific article; zbMATH DE number 922674
- scientific article; zbMATH DE number 426129
- scientific article; zbMATH DE number 426144
- scientific article; zbMATH DE number 691482
- A combinatorial problem for vector spaces over finite fields
- A new efficient factorization algorithm for polynomials over small finite fields
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- scientific article; zbMATH DE number 424718 (Why is no real title available?)
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 4005425 (Why is no real title available?)
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 584457 (Why is no real title available?)
- scientific article; zbMATH DE number 3265895 (Why is no real title available?)
- scientific article; zbMATH DE number 3318360 (Why is no real title available?)
- scientific article; zbMATH DE number 3186965 (Why is no real title available?)
- Low-discrepancy and low-dispersion sequences
- Optimal normal bases in \(GF(p^ n)\)
- Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes
- Point sets and sequences with small discrepancy
- Point sets with uniformity properties and orthogonal hypercubes
- Solving sparse linear equations over finite fields
- Statistical independence properties of pseudorandom vectors produced by matrix generators
- Univariate polynomial factorization over finite fields
- Connections between the algorithms of Berlekamp and Niederreiter for factoring polynomials over \(\mathbb{F}_ q\)
- Factorization of polynomials over finite fields and characteristic sequences
- On square-free factorization of multivariate polynomials over a finite field.
- Nonlinear vectorial primitive recursive sequences
- Bivariate factorization using a critical fiber
- Investigating results and performance of search and construction algorithms for word-based LFSRs, \(\sigma\)-LFSRs
- Riemann-Roch spaces of the Hermitian function field with applications to algebraic geometry codes and low-discrepancy sequences
- A note on the factorization method of Niederreiter
- A note on the multiple-recursive matrix method for generating pseudorandom vectors
- Subspaces and polynomial factorizations over finite fields
- Recent constructions of low-discrepancy sequences
- On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators
- Complexity of solving parametric polynomial systems
- Linearized polynomials over finite fields revisited
- 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
- Lamps, Factorizations, and Finite Fields
- Random packing of hyperspheres and Marsaglia's parking lot test
- scientific article; zbMATH DE number 4145747 (Why is no real title available?)
- scientific article; zbMATH DE number 4127347 (Why is no real title available?)
- scientific article; zbMATH DE number 1341370 (Why is no real title available?)
- Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases
- Pseudorandom Vector Generation by the Multiple-Recursive Matrix Method
- On a New Factorization Algorithm for Polynomials Over Finite Fields
- Pseudorandom number generator based on the Bernoulli map on cubic algebraic integers
- scientific article; zbMATH DE number 3893305 (Why is no real title available?)
- Factoring polynomials over finite fields: A survey
- Primitive polynomials, Singer cycles and word-oriented linear feedback shift registers
- Block companion singer cycles, primitive recursive vector sequences, and coprime polynomial pairs over finite fields
- Improvements of convex-dense factorization of bivariate polynomials
- Fast rectangular matrix multiplication and some applications
This page was built for publication: Factorization of polynomials and some linear-algebra problems over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1311328)
