On the Lin-Weldon majority-logic decoding algorithm for product codes (Corresp.)
Nguyen Quang Đuc · IEEE Transactions on Information Theory · 1973
It is shown that a majority-logic decoding algorithm proposed by Lin and Weldon for the product of anL-step and a one-step orthogonalizable code is incomplete whenLis greater than unity. An improvement is presented to overcome this disadvantage in the binary case.