On the Lin-Weldon majority-logic decoding algorithm for product codes (Corresp.)

It is shown that a majority-logic decoding algorithm proposed by Lin and Weldon for the product of an
L
-step and a one-step orthogonalizable code is incomplete when
L
is greater than unity. An improvement is presented to overcome this disadvantage in the binary case.