2Badri N.Vellambi, Faramarz Fekri.Finite-LengthRate-Compatible LD- PC Codes:A Novel Puncturing Scheme[J].IEEE Transactions on Commu- nications, 2009,57 (2) : 297 -301.
二级参考文献8
1Gallager R G. Low-density parity check codes [J]. IRE Trans Inform Theory, 1962, IT-8:21-28.
2MacKay D J C, Neal R M. Near Shannon limit performance of low density parity check codes[J]. Electronics Letters, 1996, 32(18) : 1645 - 1646.
3Fossorier M P C, Mihaljevic M, Imai H. Reduced complexity iterative decoding of low-density parity check codes based on belief propagation [J]. IEEE Trans Commun, 1999, 47(5) : 673 - 680.
4CHEN Jinghu, Fossorier M P C. Density evolution for two improved BP-based decoding algorithms of LDPC codes [J]. IEEE Communication Letters, 2002, 6(5) : 208 - 210.
5CHEN Jinghu, Fossorier M P C. Near optimum universal belief propagation-based decoding of low density parity check codes [J]. IEEE Trans Commun, 2002, 50(3): 406 -414.
6Lee J K-S, Thorpe J. Memory-efficient decoding of LDPC codes [C]//Proc IEEE ISIT, Adelaide, Australia, 2005: 459-463.
7Howard S L, Schlegel C, Gaudet V C. Degree-matched check node decoding for regular and irregular LDPCs [J]. IEEE Transactions on Circuits and Systems, 2006, 53(10): 1054 - 1058.
8MacKay D J C. Good error-correcting codes based on very sparse matrices [J]. IEEE Trans Inform Theory, 1999, 45(2): 399-431.
