Jin, Hui and McEliece, Robert J. (2000) General coding theorems for turbo-like codes. In: 2000 IEEE International Symposium on Information Theory. IEEE , Piscataway, NJ, p. 120. ISBN 0-7803-5857-0 http://resolver.caltech.edu/CaltechAUTHORS:20111130-082915053
Full text not available from this repository.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20111130-082915053
In this paper we prove that for general memoryless binary input channels, most ensembles of parallel and serial turbo codes, with fixed component codes, are “good” in the sense that with maximum likelihood decoding, their word (or bit) error probability decreases to zero as the block length increases, provided the noise is below a finite threshold. Our proof uses the classical union bound, which shows that under very general conditions, if the noise is below a certain threshold, the word (or bit) error probability is controlled by the low-weight codewords as the block length approaches infinity. Our main coding theorems then follow from a study of the low weight terms in the ensemble weight enumerator. Using this methodology, we can prove that the threshold is finite for most ensembles of parallel and serial turbo codes.
|Item Type:||Book Section|
|Additional Information:||© 2000 IEEE. Date of Current Version: 06 August 2002. This work was supported by NSF grant no. CCR-9804793, and grants from Sony and Qualcomm.|
|Other Numbering System:|
|Official Citation:||Hui Jin; McEliece, R.J.; , "General coding theorems for turbo-like codes," Information Theory, 2000. Proceedings. IEEE International Symposium on , vol., no., pp.120, 2000 doi: 10.1109/ISIT.2000.866412 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=866412&isnumber=18755|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Tony Diaz|
|Deposited On:||19 Jan 2012 18:55|
|Last Modified:||19 Jan 2012 18:55|
Repository Staff Only: item control page