Further results on the asymptotic complexity of an iterative coding scheme
J. Ziv · IEEE Transactions on Information Theory · 1966
The purpose of this paper is to demonstrate that it is possible to communicate over a memoryless channel of capacityCat any rateR 0, per block of a length approximately proportional to u^{2}and with a computational decoding complexity which is asymptotically proportional to u^{2}when uis 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 ].