A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over \(\mathbb F_2\)

DOI10.1007/s00607-005-0154-yzbMath1091.11042OpenAlexW2079508303MaRDI QIDQ2492665

Fatima K. Abu Salem

Publication date: 14 June 2006

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-005-0154-y

zbMATH Keywords

finite fieldspolynomial factorizationsparse linear equation systemsNiederreiter's algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Linear equations (linear algebraic aspects) (15A06)

Related Items (1)

COMMUNICATION BALANCING IN THE PARALLEL GÖTTFERT ALGORITHM

Cites Work

• Unnamed Item
• Connections between the algorithms of Berlekamp and Niederreiter for factoring polynomials over \(\mathbb{F}_ q\)
• Factorization of polynomials and some linear-algebra problems over finite fields
• Factorization of polynomials over finite fields and characteristic sequences
• Subspaces and polynomial factorizations over finite fields
• A new efficient factorization algorithm for polynomials over small finite fields
• The Elimination form of the Inverse and its Application to Linear Programming
• Parallel Sparse LU Decomposition on a Mesh Network of Transputers
• Factoring high-degree polynomials over $\mathbf F_2$ with Niederreiter's algorithm on the IBM SP2
• The black-box Niederreiter algorithm and its implementation over the binary field
• Factoring a binary polynomial of degree over one million
• Parallel Processing and Applied Mathematics
• The Solution of Large Sparse Unsymmetric Systems of Linear Equations

This page was built for publication: A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over \(\mathbb F_2\)