Majority Decoding of Linear Codes

An $M$-decoding procedure is described, which generalizes the conventional one-step majority-decoding procedures. It is shown that any linear code correcting an error set closed under multiplication by elements of the basic field can be $M$-decoded. In particular, all binary linear codes can be $M$-decoded.