| 1. Gallager R G. Low density parity check codes. IRE Transactions on Inform Theory, 1962, 8(1): 21-28
2. Mackay D J C, Neal R M. Near Shannon limit performance of low density parity check codes. Electronics Letters, 1996, 32(18): 1645-1646
3. Davey M C, Mackay D. Low-density parity-check codes over GF(q). IEEE Communications Letters, 1998, 2(6): 165-167
4. Hu X Y, Eleftheriou E, Arnold D M. Regular and irregular progressive edge-growth Tanner graphs. IEEE Transactions on Information Theory, 2005, 51(1): 386-398
5. Davey M C. Error-correction using low-density parity-check codes. Cambridge, UK: University of Cambridge, 1999
6. Mackay D J C. Optimizing sparse graph codes over GF(q). Cambridge, UK: Cavendish Laboratory, 2003
7. Kimura D, Guilloud F, Pyndiah R M. Construction of parity-check matrices for non-binary LDPC codes. Proceedings of the 4th International symposium on Turbo Codes and Related Topics, Apr 3-7, 2007, Munich, Germany. 2007
8. Vardy A. The intractability of computing the minimum distance of a code. IEEE Transactions on Information Theory, 1997, 43(6): 1757-1766
9. Tanner R M. Minimum-distance bounds by graph analysis. IEEE
Transactions on Information Theory, 2001, 47(2): 808-821
10. Mao Y Y, Banihashemi A H. A heuristic search for good low-density parity-check codes at short block lengths. Proceedings of IEEE International Conference on Communications(ICC’01): Vol 1, Jun 11-14, 2001, Helsinki, Finland. Piscataway, NJ, USA: IEEE, 2001: 41-44
11. Hu X Y, Eleftheriou E, Arnold D M. Irregular progressive edge-growth Tanner graphs. Proceedings of IEEE International Symposium on Information Theory (ISIT’02), Jun 30-Jul 5, Lausanne, Switzerland. Piscataway, NJ, USA: IEEE, 2002: 480
|
