Factorization of polynomials and some linear-algebra problems over finite fields

DOI10.1016/0024-3795(93)90247-LzbMath0845.11042OpenAlexW2051598761MaRDI QIDQ1311328

Harald Niederreiter

Publication date: 30 January 1994

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(93)90247-l

zbMATH Keywords

linear block codesfactorization of polynomials over finite fieldsdifferential equationscombinatorial vector spacesHasse-Teichmüller derivativemultiple-recursive matrix methodpseudorandom vector generationuniform point distributions in unit cubes

Mathematics Subject Classification ID

Matrices over special rings (quaternions, finite fields, etc.) (15B33) Polynomials over finite fields (11T06) General theory of distribution modulo (1) (11K06) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items

Pseudorandom number generator based on the Bernoulli map on cubic algebraic integers, Nonlinear vectorial primitive recursive sequences, Univariate polynomial factorization over finite fields, Bivariate factorization using a critical fiber, 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, Fast rectangular matrix multiplication and some applications, Recent constructions of low-discrepancy sequences, On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators, Investigating results and performance of search and construction algorithms for word-based LFSRs, \(\sigma\)-LFSRs, Factoring polynomials over finite fields: A survey, Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases, Complexity of solving parametric polynomial systems, Unnamed Item, Riemann-Roch spaces of the Hermitian function field with applications to algebraic geometry codes and low-discrepancy sequences, A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over \(\mathbb F_2\), A note on the factorization method of Niederreiter, A note on the multiple-recursive matrix method for generating pseudorandom vectors, On a New Factorization Algorithm for Polynomials Over Finite Fields, Pseudorandom Vector Generation by the Multiple-Recursive Matrix Method, Random packing of hyperspheres and Marsaglia's parking lot test, Substitutions for linear shift register sequences and the factorization algorithms of Berlekamp and Niederreiter, Subspaces and polynomial factorizations over finite fields, Connections between the algorithms of Berlekamp and Niederreiter for factoring polynomials over \(\mathbb{F}_ q\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Point sets and sequences with small discrepancy
• Statistical independence properties of pseudorandom vectors produced by matrix generators
• Low-discrepancy and low-dispersion sequences
• Optimal normal bases in \(GF(p^ n)\)
• A combinatorial problem for vector spaces over finite fields
• Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes
• Point sets with uniformity properties and orthogonal hypercubes
• A new efficient factorization algorithm for polynomials over small finite fields
• Solving sparse linear equations over finite fields
• Fast solution of toeplitz systems of equations and computation of Padé approximants