Abstract:
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 gre...Show MoreMetadata
Abstract:
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.
Published in: IEEE Transactions on Information Theory ( Volume: 19, Issue: 4, July 1973)