On the Complexity of finding stopping set size in Tanner Graphs
暂无分享,去创建一个
[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[2] Richard D. Wesel,et al. Construction of irregular LDPC codes with low error floors , 2003, IEEE International Conference on Communications, 2003. ICC '03..
[3] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[4] A. Orlitsky,et al. Stopping sets and the girth of Tanner graphs , 2002, Proceedings IEEE International Symposium on Information Theory,.
[5] Richard D. Wesel,et al. Construction of short block length irregular low-density parity-check codes , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).
[6] Robert Michael Tanner,et al. A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.
[7] Alexander Vardy,et al. On the stopping distance and the stopping redundancy of codes , 2006, IEEE Transactions on Information Theory.
[8] Emre Telatar,et al. Finite-length analysis of low-density parity-check codes on the binary erasure channel , 2002, IEEE Trans. Inf. Theory.