On Rudolph's majority-logic decoding algorithm (Corresp.)

In this correspondence, a modification of Rudolph's one-step majority-logic decoding algorithm is introduced. Using this modification, it is proved that all single-error-correcting codes can be one-step majority decoded.