1 |
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.
|
2 |
C. Berrou and A. Glavieux, "Near optimum error correcting coding and decoding: turbocodes," IEEE Trans. Commun., vol. 44, October 1996, pp.1261-1271.
DOI
ScienceOn
|
3 |
T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching low-density parity-check codes," IEEE Trans. Inform. Theory, Vol.47, Feb. 2001, pp.619-637.
DOI
ScienceOn
|
4 |
R. Gallager, "Low density parity check codes," MIT press, 1963.
|
5 |
D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," Electronics Letters, Vol.33, March 1997, pp.457-458.
DOI
ScienceOn
|
6 |
J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Mateo, CA: Morgan Kaufmann, 1988.
|
7 |
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.
|
8 |
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.
과학기술학회마을
|
9 |
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.
|