, Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm, Math. Comp. 62 (1994), no. 205, 333--350. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A study of Coppersmith's block Wiedemann algorithm using matrix.. - Villard (1997) (10 citations) (Correct)
....the probability bound of Kaltofen in the case of large cardinality fields. Lastly, for the sake of completeness of the generalization of Wiedemann s work to the matrix case, we will briefly sketch a deterministic block algorithm. 1. Introduction The randomized method proposed by Coppersmith [9] solves large sparse systems of homogeneous linear equations Aw = 0, w 6= 0. Throughout the paper A will be a singular N Theta N matrix over the Galois field with q elements K =GF(q) and w a vector of N unknowns. One fundamental application of this problem is integer and polynomial factorization, ....
....Anyway, these various approaches are very similar: they can be understood in a unified theory [24] But since they use generating polynomials of scalar sequences, these latter algorithms impose limitations if one wants to perform several operations at a time. To solve this problem, Coppersmith [9] modifies the approach of Wiedemann and uses LMC IMAG, B.P. 53 F38041 Grenoble cedex 9, Gilles.Villard imag.fr, April 23, 1997. 1991 Mathematics Subject Classification. Primary 15A06, 15A33; Secondary 15 04, 13P99. Key words and phrases. Sparse linear systems, finite fields, exact arithmetic, ....
[Article contains additional citation context not shown here]
, Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm, Math. Comp. 62 (1994), no. 205, 333--350.
A study of Coppersmith's block Wiedemann algorithm using matrix.. - Villard (10 citations) Self-citation (Gf) (Correct)
....the probability bound of Kaltofen in the case of large cardinality fields. Lastly, for the sake of completeness of the generalization of Wiedemann s work to the matrix case, we will briefly sketch a deterministic block algorithm. 1. Introduction The randomized method proposed by Coppersmith [9] solves large sparse systems of homogeneous linear equations Aw = 0, w 6= 0. Throughout the paper A will be a singular N Theta N matrix over the Galois field with q elements K =GF(q) and w a vector of N unknowns. One fundamental application of this problem is integer and polynomial factorization, ....
....Anyway, these various approaches are very similar: they can be understood in a unified theory [24] But since they use generating polynomials of scalar sequences, these latter algorithms impose limitations if one wants to perform several operations at a time. To solve this problem, Coppersmith [9] modifies the approach of Wiedemann and uses LMC IMAG, B.P. 53 F38041 Grenoble cedex 9, Gilles.Villard imag.fr, April 23, 1997. 1991 Mathematics Subject Classification. Primary 15A06, 15A33; Secondary 15 04, 13P99. Key words and phrases. Sparse linear systems, finite fields, exact arithmetic, ....
[Article contains additional citation context not shown here]
, Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm, Math. Comp. 62 (1994), no. 205, 333--350.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC