The equivalence of L-step orthogonalization and a Reed decoding procedure (Corresp.)

This correspondence shows the formal equivalence between Massey's decoding scheme called threshold decoding involving
L
-step orthogonalizable codes and Reed's decoding scheme originally conceived for the Muller codes. Upon examining these two decoding algorithms it is shown that each can be described in terms of a decoding logic circuit. The formal equivalence of the algorithms is proved by showing the formal equivalence of their respective decoding circuits.