Solving underdetermined systems with error-correcting codes (Q725952)

Summary: In an underdetermined system of equations \(Aw = y\), where \(A\) is an \(m \times n\) matrix, only \(u\) of the entries of \(y\) with \(u < m\) are known. Thus \(E_{j}w\), called `measurements', are known for certain \(j \in J \{0, 1,\ldots, m-1\}\) where \(\{E_{i}, i = 0, 1,\ldots, m-1\}\) are the rows of \(A\) and \(|J| = u\). It is required, if possible, to solve the system uniquely when \(x\) has at most \(t\) non-zero entries with \(u \geq 2t\). Here such systems are considered from an error-correcting coding point of view. This reduces the problem to finding a suitable decoding algorithm which then finds \(w\). Decoding workable algorithms are shown to exist, from which the unknown \(w\) may be determined, in cases where the known\(2t\) values are evenly spaced, that is when the elements of \(J\) are in arithmetic sequence. The method can be applied to Fourier matrices and certain classes of Vandermonde matrices. The decoding algorithm has complexity \(O(nt)\) and in some cases the complexity is \(O(t^{2})\). Matrices which have the property that the determinant of any square submatrix is non-zero are of particular interest. Randomly choosing rows of such matrices can then give \(t\) error-correcting pairs to generate a 'measuring' code. This has applications to signal processing and compressed sensing.