A new method of detecting cycles in Tanner graph of LDPC codes
暂无分享,去创建一个
Gang Wang | Bo Li | G. Wang | Hong-juan Yang | Bo Li | Hongjuan Yang
[1] Dai Fu-sheng. An Algorithm to Calculate Entire Routes between Communication Network Nodes based on Logic Algebra , 2006 .
[2] Xiaohui Qi,et al. A new source route algorithm of communication network , 2006 .
[3] Shu Lin,et al. Iterative decoding of one-step majority logic deductible codes based on belief propagation , 2000, IEEE Trans. Commun..
[4] Radford M. Neal,et al. Near Shannon limit performance of low density parity check codes , 1996 .
[5] Daniel A. Spielman,et al. Expander codes , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[6] Robert Michael Tanner,et al. A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.
[7] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.