DocumentCode :
907594
Title :
Further results on the asymptotic complexity of an iterative coding scheme
Author :
Ziv, Jacob
Volume :
12
Issue :
2
fYear :
1966
fDate :
4/1/1966 12:00:00 AM
Firstpage :
168
Lastpage :
171
Abstract :
The purpose of this paper is to demonstrate that it is possible to communicate over a memoryless channel of capacity 
at any rate 
with a probability of error less than 
, per block of a length approximately proportional to 
and with a computational decoding complexity which is asymptotically proportional to when 
is large. The decoding scheme presented in this paper is based on a two-cycle iteration of a decoding procedure which has been described in an earlier paper [1 ].
at any rate with a probability of error less than , per block of a length approximately proportional to and with a computational decoding complexity which is asymptotically proportional to when is large. The decoding scheme presented in this paper is based on a two-cycle iteration of a decoding procedure which has been described in an earlier paper [1 ].Keywords :
Computation theory; Decoding; Memoryless channels; Product codes; Associate members; Capacity planning; Channel capacity; Iterative decoding; Jacobian matrices; Memoryless systems; Parity check codes; Probability;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1966.1053878
Filename :
1053878
Link To Document :
