Finding the Exhaustive List of Small Fully Absorbing Sets and Designing the Corresponding Low Error-Floor Decoder
暂无分享,去创建一个
[1] O. Milenkovic,et al. Algorithmic and combinatorial analysis of trapping sets in structured LDPC codes , 2005, 2005 International Conference on Wireless Networks, Communications and Mobile Computing.
[2] P. Vontobel,et al. Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes , 2005, ArXiv.
[3] David Burshtein,et al. Efficient maximum-likelihood decoding of LDPC codes over the binary erasure channel , 2004, IEEE Transactions on Information Theory.
[4] Daniel J. Costello,et al. LDPC block and convolutional codes based on circulant matrices , 2004, IEEE Transactions on Information Theory.
[5] Shuai Zhang,et al. On the dynamics of the error floor behavior in regular LDPC codes , 2009 .
[6] Dong Zijian,et al. Improved Decoding Algorithms Based on Oscillation Log-likelihood Ratio for Low-density Parity Check Codes , 2011 .
[7] Lara Dolecek,et al. GEN03-6: Investigation of Error Floors of Structured Low-Density Parity-Check Codes by Hardware Emulation , 2006, IEEE Globecom 2006.
[8] Evangelos Eleftheriou,et al. On the computation of the minimum distance of low-density parity-check codes , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).
[9] David Declercq,et al. Trapping set enumerators for specific LDPC codes , 2010, 2010 Information Theory and Applications Workshop (ITA).
[10] Ahmet B. Keha,et al. Minimum distance computation of LDPC codes using a branch and cut algorithm , 2010, IEEE Transactions on Communications.
[11] Amir H. Banihashemi,et al. An efficient algorithm for finding dominant trapping sets of LDPC codes , 2011, 2010 6th International Symposium on Turbo Codes & Iterative Information Processing.
[12] Thomas J. Richardson,et al. Error Floors of LDPC Codes , 2003 .
[13] Rüdiger L. Urbanke,et al. The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.
[14] I.B. Djordjevic,et al. Low-density parity-check codes for 40-gb/s optical transmission systems , 2006, IEEE Journal of Selected Topics in Quantum Electronics.
[15] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[16] Lara Dolecek,et al. Predicting error floors of structured LDPC codes: deterministic bounds and estimates , 2009, IEEE Journal on Selected Areas in Communications.
[17] Elwyn R. Berlekamp,et al. On the inherent intractability of certain coding problems (Corresp.) , 1978, IEEE Trans. Inf. Theory.
[18] Emre Telatar,et al. Finite-length analysis of low-density parity-check codes on the binary erasure channel , 2002, IEEE Trans. Inf. Theory.
[19] Amir H. Banihashemi,et al. An efficient algorithm for finding dominant trapping sets of irregular LDPC codes , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.
[20] Øyvind Ytrehus,et al. An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices , 2009, IEEE Transactions on Information Theory.
[21] Aleksandar Kavcic,et al. Augmented Belief-Propagation Decoding of Low-Density Parity-Check Codes , 2006, IEEE Transactions on Communications.
[22] H. Jin,et al. Irregular repeat accumulate codes , 2000 .
[23] Tor Helleseth,et al. On the minimum distance of array codes as LDPC codes , 2003, IEEE Trans. Inf. Theory.
[24] Priti Shankar,et al. On the Complexity of finding stopping set size in Tanner Graphs , 2006, 2006 40th Annual Conference on Information Sciences and Systems.
[25] Shashi Kiran Chilappagari,et al. Error Floors of LDPC Codes on the Binary Symmetric Channel , 2006, 2006 IEEE International Conference on Communications.
[26] H. Vincent Poor,et al. Finding All Small Error-Prone Substructures in LDPC Codes , 2009, IEEE Transactions on Information Theory.
[27] Babak Daneshrad,et al. Low BER performance estimation of LDPC codes via application of importance sampling to trapping sets , 2009, IEEE Transactions on Communications.
[28] Stephen G. Wilson,et al. A General Method for Finding Low Error Rates of LDPC Codes , 2006, ArXiv.
[29] G. A. Margulis,et al. Explicit constructions of graphs without short cycles and low density codes , 1982, Comb..
[30] Babak Daneshrad,et al. A performance improvement and error floor avoidance technique for belief propagation decoding of LDPC codes , 2005, 2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications.
[31] David Burshtein,et al. On the Error Correction of Regular LDPC Codes Using the Flipping Algorithm , 2007, IEEE Transactions on Information Theory.
[32] Alexander Vardy,et al. The intractability of computing the minimum distance of a code , 1997, IEEE Trans. Inf. Theory.
[33] John Cocke,et al. Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.
[34] Lara Dolecek,et al. Lowering LDPC Error Floors by Postprocessing , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.
[35] David J. C. MacKay,et al. Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check cCodes , 2003, MFCSIT.
[36] William E. Ryan,et al. Low-floor decoders for LDPC codes , 2009, IEEE Transactions on Communications.
[37] Michael Chertkov,et al. Instanton analysis of Low-Density Parity-Check codes in the error-floor regime , 2006, 2006 IEEE International Symposium on Information Theory.
[38] Evangelos Eleftheriou,et al. Regular and irregular progressive edge-growth tanner graphs , 2005, IEEE Transactions on Information Theory.
[39] RosnesEirik,et al. An efficient algorithm to find all small-size stopping sets of low-density parity-check matrices , 2009 .
[40] Lara Dolecek,et al. Analysis of Absorbing Sets and Fully Absorbing Sets of Array-Based LDPC Codes , 2009, IEEE Transactions on Information Theory.