Finite-length scaling of turbo-like code ensembles on the binary erasure channel
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Capacity-approaching irregular turbo codes for the binary erasure channel
IEEE Transactions on Communications
| Hi-index | 754.84 |
In this correspondence, the stopping set of turbo codes with iterative decoding in the binary erasure channel is defined. Block and bit erasure probabilities of turbo codes are studied by using the stopping set analysis. It is found that block and bit erasure probabilities of turbo codes with iterative decoding are higher than those with maximum-likelihood decoding, where the differences are negligible in the error floor region. It is shown that in the error floor region, block and bit erasure probabilities of turbo codes with iterative decoding are dominated by small stopping sets and are asymptotically dominated by low weight codewords.