One-step weighted-majority decoding (Corresp.)
L. Rudolph, Woodrow E. Robbins · IEEE Transactions on Information Theory · 1972
It is shown that any decoding function for a linear binary code can be realized as a weighted majority of nonorthogonal parity checks. An example is given of a four-error-correcting code that is neither L-step orthogonalizable nor one-step majority decodable using non-orthogonal parity checks and yet is one-step weighted-majority decodable using only ten nonorthogonal parity checks.