Waterfall performance analysis of finite-length LDPC codes on symmetric channels
暂无分享,去创建一个
[1] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[2] Hua Xiao,et al. Error Rate Estimation of Finite-Length Low-Density Parity-Check Codes on Binary Symmetric Channels Using Cycle Enumeration , 2007, 2007 IEEE International Symposium on Information Theory.
[3] Hua Xiao,et al. Error rate estimation of finite-length low-density parity-check codes decoded by soft-decision iterative algorithms , 2008, 2008 IEEE International Symposium on Information Theory.
[4] Emre Telatar,et al. Finite-length analysis of low-density parity-check codes on the binary erasure channel , 2002, IEEE Trans. Inf. Theory.
[5] Stephan ten Brink,et al. Convergence behavior of iteratively decoded parallel concatenated codes , 2001, IEEE Trans. Commun..
[6] Johannes B. Huber,et al. Information Theory Information processing characteristics and BER-bounds for concatenated coding schemes , 2005, Eur. Trans. Telecommun..
[7] Niclas Wiberg,et al. Codes and Decoding on General Graphs , 1996 .
[8] Rüdiger L. Urbanke,et al. Modern Coding Theory , 2008 .
[9] Hua Xiao,et al. Estimation of Bit and Frame Error Rates of Finite-Length Low-Density Parity-Check Codes on Binary Symmetric Channels , 2007, IEEE Transactions on Communications.
[10] Sae-Young Chung,et al. Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation , 2001, IEEE Trans. Inf. Theory.
[11] Elwyn R. Berlekamp,et al. Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. II , 1967, Inf. Control..
[12] Alon Orlitsky,et al. Finite-length analysis of LDPC codes with large left degrees , 2002, Proceedings IEEE International Symposium on Information Theory,.
[13] C. Shannon. Probability of error for optimal codes in a Gaussian channel , 1959 .
[14] Andrea Montanari,et al. Further results on finite-length scaling for iteratively decoded LDPC ensembles , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..
[15] Rüdiger L. Urbanke,et al. The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.
[16] Martin E. Hellman,et al. Probability of error, equivocation, and the Chernoff bound , 1970, IEEE Trans. Inf. Theory.
[17] N. Sloane,et al. Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. I , 1993 .
[18] Andrea Montanari,et al. Finite-Length Scaling for Iteratively Decoded LDPC Ensembles , 2004, IEEE Transactions on Information Theory.
[19] T. Richrdson,et al. Finite-length analysis of various low-density parity-check ensembles for the binary erasure channel , 2002, Proceedings IEEE International Symposium on Information Theory,.