Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Solving sparse linear equations over finite fields

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
1 Author(s)

A "coordinate recurrence" method for solving sparse systems of linear equations over finite fields is described. The algorithms discussed all require O(n_{1}(\omega + n_{1})\log ^{k}n_{1}) field operations, where n_{1} is the maximum dimension of the coefficient matrix, \omega is approximately the number of field operations required to apply the matrix to a test vector, and the value of k depends on the algorithm. A probabilistic algorithm is shown to exist for finding the determinant of a square matrix. Also, probabilistic algorithms are shown to exist for finding the minimum polynomial and rank with some arbitrarily small possibility of error.

Published in:

Information Theory, IEEE Transactions on  (Volume:32 ,  Issue: 1 )