DocumentCode
917177
Title
Further results on majority-logic decoding of product codes (Corresp.)
Author
Nguyen Duc
Volume
18
Issue
2
fYear
1972
fDate
3/1/1972 12:00:00 AM
Firstpage
308
Lastpage
310
Abstract
In this correspondence additional results on majority-logic decoding of product codes are presented. If one of the component codes is decodable using Rudolph\´s nonorthogonal algorithm, and the other using Reed-Massey\´s
-step orthogonalization, then the resulting product code is majority-logic decodable in
steps, where nonorthogonal checks are used in the first step and orthogonal checks in the remaining steps. If the component codes are both decodable using Rudolph\´s algorithm, the product code is majority-logic decodable using the same procedure.
-step orthogonalization, then the resulting product code is majority-logic decodable in
steps, where nonorthogonal checks are used in the first step and orthogonal checks in the remaining steps. If the component codes are both decodable using Rudolph\´s algorithm, the product code is majority-logic decodable using the same procedure.Keywords
Majority logic decoding; Product codes; Arithmetic; Australia; Decoding; Information science; Product codes; Upper bound; Welding;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1972.1054784
Filename
1054784
Link To Document