Performance analysis of linear codes under maximum-likelihood decoding: a tutorial
Communications and Information Theory
Good concatenated code ensembles for the binary erasure channel
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
A channel representation method for the study of hybrid retransmission-based error control
IEEE Transactions on Communications
Spectra and minimum distances of repeat multiple-accumulate codes
IEEE Transactions on Information Theory
Distributed turbo trellis coded modulation for cooperative communications
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
| Hi-index | 754.90 |
This paper is devoted to a Shannon-theoretic study of turbo codes. We prove that ensembles of parallel and serial turbo codes are "good" in the following sense. For a turbo code ensemble defined by a fixed set of component codes (subject only to mild necessary restrictions), there exists a positive number γ0 such that for any binary-input memoryless channel whose Bhattacharyya noise parameter is less than γ0, the average maximum-likelihood (ML) decoder block error probability approaches zero, at least as fast as n -β, where β is the "interleaver gain" exponent defined by Benedetto et al. in 1996