Factorization of polynomials and some linear-algebra problems over finite fields (Q1311328): Difference between revisions

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.