Gallager R G. Low-density parity-check codes[J].IEEETrans. on Information Theory.1962, 8(1):21-28[2]Mackay D J C. Good error-correcting codes based on verysparse matrices [J].IEEE Trans. on Information Theory.1999, 45(3):399-431[3]Heum C C. Technical issues for enhanced and beyond 3Gsystems[C]. The International Forum Future MobileTelecommunications China-EU Post Conference onBeyond 3G, Beijing, China, 2002: 892-901.[4]Hocevar D E. LDPC code construction with flexiblehardware implementation[C]. in Proc. IEEE Int. Conf.Communications (ICC), Dallas, TX, USA , May 2003:708-2711.[5]Fossorier M P C. Quasi-cyclic low-density parity-check codesfrom circulant permutation matrices[J].IEEE Trans onInformation Theory.2004, 50(8):1788-1793[6]Yang M, Li Yi, and Ryan W E. Design of efficientlyencodable moderate-length high-rate irregular LDPC codes[J].IEEE Trans. on Commun.2004, 52(4):564-571[7]Divsalar D, Dolinar S, and Pollara F. Iterative turbo decoderanalysis based on density evolution [J].IEEE J. Select. Areain Commun.2001,19(5):891-907[8]Kang Jingyu, Fan Pingyi, and Cao Zhigang. Flexibleconstruction of irregular partitioned permutation LDPCcodes with low error floors [J].IEEE Communications Letters.2005, 9(6):534-536[9]Fan. J. Array codes as low-density parity-check codes [C]. inProc. 2nd Int. Symp. on Turbo Codes Related Topics,Brest, France, Sep. 2000: 543-546.[10]Tian T, Jones C, and Villasenor J, et al.. Construction ofirregular ldpc codes with low error floors [C]. in Proc. IEEEInt. Conf. Communications (ICC), Dallas, TX, USA , May2003: 3125-3129.[11]Richardson T, Shokrollahi A, and Urbanke R. Design ofcapacity approaching irregular low-density parity-check codes[J].IEEE Trans. on Informatiom Theory.2001, 47(2):638-656[12]McGowan J A and Williamson R C. Loop removal from ldpccodes [C]. in Proc. IEEE Info. on Theory Workshop (ITW),Paris, France, Mar. 2003: 230-233.[13]Hu Xiao Yu and Fossorier M P C. On the computation of theminimum distance of low-density parity_check codes[C].2004 IEEE International Conference on Communications,Paris, France, June 2004, Vol.2: 767-771.
|