A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf
.
Bounds on the number of iterations for turbo-like code ensembles over the binary erasure channel
2008
2008 IEEE International Symposium on Information Theory
We derive simple lower bounds on the number of iterations which are required to communicate over the binary erasure channel when graph-based code ensembles are used in conjunction with an iterative message-passing decoder. These bounds refer to the asymptotic case where we let the block length tend to infinity, and the bounds apply to general ensembles of lowdensity parity-check (LDPC) codes, irregular repeat-accumulate (IRA) and accumulate-repeat-accumulate (ARA) codes. It is demonstrated
doi:10.1109/isit.2008.4595318
dblp:conf/isit/SasonW08
fatcat:a5bioqs7bndddo4f2s4guuo4ja