Title :
On decoding iterated codes
Author :
Reddy, Sudhakar M.
fDate :
9/1/1970 12:00:00 AM
Abstract :
Algorithms to decode iterated codes when at least one of the "component codes" is majority decodable are given. The decoding algorithms allow the use of the decoders of the component codes and still make it possible to correct all error patterns guaranteed to be correctable by the minimum distance of the iterated code.
Keywords :
Decoding; Product codes; Artificial satellites; Communications technology; Convolutional codes; Distributed computing; Electrons; Information theory; Iterative decoding; Jacobian matrices; Upper bound; Viterbi algorithm;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.1970.1054504