1 |
D. Divsalar, "A simple tight bound on error probability of block codes with application to turbo codes," TMO Progress Reports 42-139., Jet Propulsion Lab, November 1999
|
2 |
D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," Electronics Letters, Vol.33, March 1997, pp.457-458
DOI
ScienceOn
|
3 |
K. Chung and J. Heo, "Upper bounds for the performance of turbo-like codes and low density parity check codes," KICS Journal of Communications and Networks, Vol.10, No.1, March 2008, pp.5-9
DOI
|
4 |
L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inform. Theory, Vol.IT-20, March 1974, pp.284-287
|
5 |
C. Berrou and A. Glavieux, "Near optimum error correcting coding and decoding: turbo-codes," IEEE Trans. Commun., Vol.44, October 1996, pp.1261-1271
DOI
ScienceOn
|
6 |
R. Gallager, "Low density parity check codes," MIT press, 1963
|
7 |
S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding," IEEE Trans. Inform.Theory, May 1998, pp.909-926
|