DocumentCode
919691
Title
On the Lin-Weldon majority-logic decoding algorithm for product codes (Corresp.)
Author
Duc, Nguyen Quang
Volume
19
Issue
4
fYear
1973
fDate
7/1/1973 12:00:00 AM
Firstpage
581
Lastpage
583
Abstract
It is shown that a majority-logic decoding algorithm proposed by Lin and Weldon for the product of an
-step and a one-step orthogonalizable code is incomplete when
is greater than unity. An improvement is presented to overcome this disadvantage in the binary case.
-step and a one-step orthogonalizable code is incomplete when
is greater than unity. An improvement is presented to overcome this disadvantage in the binary case.Keywords
Majority logic decoding; Product codes; Decoding; Error correction codes; Hamming distance; Parity check codes; Product codes; Welding;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1973.1055029
Filename
1055029
Link To Document