References
- R. G. Gallager, 'Low-density parity-check codes,' IRE Trans. Inform. Theory, pp. 21-28, Jan. 1962
- D. J. C. MacKay and R M. Neal, 'Near Shannon limit performance of low desnsity parity check codes,' IEE Electon. Lett., pp. 1645-1646, Aug. 1996
- T. J. Richardson, A. Shokrollahi, and R. L. Urbanke, 'Design of capacity-approaching irregular low-density parity-check codes,' IEEE Trans. Inform. Theory, pp. 619-637, Feb. 2001
- T. J. Richardson and R. L. Urbanke, 'Efficient encoding of low-density parity-check codes,' IEEE Trans. Inform. Theory, pp. 638 -656, Feb. 2001
- H. Jin, A. Khandekar, and R. McEliece, 'Irregular repeat-accumulate codes,' pp. 1-8 in Proc. 2nd International Symposium on Turbo Codes and Related Topics, Brest, France, Sept. 2000
- L. Ping and K. Y. Wu, 'Concatenated tree codes: a low-complexity, high-performance approach,' IEEE Trans. Inform. Theory, pp. 791-799, Feb. 2001
- L. Ping, X. L. Huang, and N. Phamdo, 'Zigzag codes and concatenated zigzag codes,' IEEE Trans. Inform. Theory, pp. 800-807, Feb. 2001
- F. R. Kschischang and B. J. Frey, 'Iterative decoding of compound codes by probability propagation in graphical models,' IEEE J. Select. Areas Commun., pp. 219-230, Feb. 1998
- T. J. Richardson and R. L. Urbanke, 'The capacity of low-density parity-check codes under message-passing decoding,' IEEE Trans. Inform. Theory, pp. 599-618, Feb. 2001
- S. Y. Chung, T. J. Richardson, and R. L. Urbanke, 'Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation,' IEEE Trans. Inform. Theory, pp. 657-670, Feb. 2001