Further results on the asymptotic complexity of an iterative coding scheme | IEEE Journals & Magazine | IEEE Xplore

Further results on the asymptotic complexity of an iterative coding scheme


Abstract:

The purpose of this paper is to demonstrate that it is possible to communicate over a memoryless channel of capacityCat any rateR < Cwith a probability of error less than...Show More

Abstract:

The purpose of this paper is to demonstrate that it is possible to communicate over a memoryless channel of capacityCat any rateR < Cwith a probability of error less than2^{-E(R)\nu},E(R)>0, per block of a length approximately proportional to\nu^{2}and with a computational decoding complexity which is asymptotically proportional to\nu^{2}when\nuis 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 ].
Published in: IEEE Transactions on Information Theory ( Volume: 12, Issue: 2, April 1966)
Page(s): 168 - 171
Date of Publication: 06 January 2003

ISSN Information:


References

References is not available for this document.