Performance comparison between non-binary LDPC codes and Reed-Solomon codes over noise bursts channels
暂无分享,去创建一个
[1] David J. C. MacKay,et al. Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.
[2] Guanrong Chen,et al. Density evolution method and threshold decision for irregular LDPC codes , 2004, 2004 International Conference on Communications, Circuits and Systems (IEEE Cat. No.04EX914).
[3] David J. C. MacKay,et al. Low-density parity check codes over GF(q) , 1998, IEEE Communications Letters.
[4] Radford M. Neal,et al. Near Shannon limit performance of low density parity check codes , 1996 .
[5] Rüdiger L. Urbanke,et al. The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.
[6] Robert Michael Tanner,et al. A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.
[7] Nazanin Rahnavard,et al. Nonuniform error correction using low-density parity-check codes , 2005, IEEE Transactions on Information Theory.