1 |
L. Ping and W. Y. Keying, 'Concatenated tree codes: A low complexity, high-performance approach,' IEEE Trans. Inform. Theory, vol. 47, pp. 791-799, February 2001
DOI
ScienceOn
|
2 |
T. J. Richardson and R. L. Urbanke, 'The capacity of low-density parity-check codes under . message-passing decoding,' IEEE Trans. Inform
|
3 |
A. Anastasopoulos, 'A comparison between the sum-product and the min-sum iterative detection algorithm based on density evolution,' in Proc. Globecom Conf., pp.10211025, 2001
|
4 |
Jun Heo, 'Performance and Convergence Analysis of Improved MIN-SUM Iterative Decoding Algorithm,' IEICE Trans. on Comm., vol.E87-B, no 10., pp. 2847-2858, Oct. 2004
|
5 |
D. Divsalar, H. Jin, and R. McEliece, 'Coding theorems for turbo-like codes,' in Proc. 36th Annu. Allerton Conference Communi cation, Control, Computing, pp. 201-210, September 1998
|
6 |
R. G. Gallager, 'Low-density parity-check codes,' IRE Trans. Inform. Theory, vol. IT-8, pp. 21-28, January 1962
|
7 |
Jun Heo and Kyuhyuk Chung, 'Tree-LOPC codes for IEEE 802.16 broadband wireless internet,' ICCE, Las Vegas January 2005
|