Abstract:
Undetermined systems of random linear Boolean equations with corrupted right-hand side and with a true solution of little Hamming weight are studied. Experimentally, we show that, for small bit-error rates, these systems can be efficiently solved by decoding algorithms with regard to information symbols.
Keywords:random systems of linear Boolean equations, information-set decoding.