MB iterative decoding algorithm on systematic LDGM codes: Performance evaluation
暂无分享,去创建一个
[1] Amir H. Banihashemi,et al. Threshold values and convergence properties of majority-based algorithms for decoding regular low-density parity-check codes , 2004, IEEE Transactions on Communications.
[2] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[3] Sammy Chan,et al. Iterative decoding of multi-dimensional concatenated single parity check codes , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).
[4] Robert Michael Tanner,et al. A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.
[5] Wei Zhong,et al. LDGM Codes for Channel Coding and Joint Source-Channel Coding of Correlated Sources , 2005, EURASIP J. Adv. Signal Process..
[6] Rüdiger L. Urbanke,et al. Exact thresholds and optimal codes for the binary-symmetric channel and Gallager's decoding algorithm A , 2000, IEEE Transactions on Information Theory.
[7] Wei Zhong,et al. Approaching Shannon performance by iterative decoding of linear codes with low-density generator matrix , 2003, IEEE Communications Letters.
[8] Matching Code-on-Graph with Network-on-Graph : Adaptive Network Coding for Wireless Relay Networks , 2005 .
[9] Jung-Fu Cheng,et al. Some High-Rate Near Capacity Codecs for the Gaussian Channel , 1996 .
[10] Daniel A. Spielman,et al. Practical loss-resilient codes , 1997, STOC '97.
[11] Rüdiger L. Urbanke,et al. Modern Coding Theory , 2008 .