Finite Alphabet Iterative Decoders—Part II: Towards Guaranteed Error Correction of LDPC Codes via Iterative Decoder Diversity
暂无分享,去创建一个
David Declercq | Bane V. Vasic | Shiva Kumar Planjery | Erbao Li | D. Declercq | B. Vasic | S. Planjery | Erbao Li
[1] John E. Hopcroft,et al. Complexity of Computer Computations , 1974, IFIP Congress.
[2] Daniel J. Costello,et al. LDPC block and convolutional codes based on circulant matrices , 2004, IEEE Transactions on Information Theory.
[3] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[4] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .
[5] Shashi Kiran Chilappagari,et al. Eliminating trapping sets in low-density parity-check codes by using Tanner graph covers , 2008, IEEE Transactions on Information Theory.
[6] Lara Dolecek,et al. Analysis of Absorbing Sets and Fully Absorbing Sets of Array-Based LDPC Codes , 2009, IEEE Transactions on Information Theory.
[7] David Declercq,et al. Finite alphabet iterative decoders approaching maximum likelihood performance on the Binary Symmetric Channel , 2012, 2012 Information Theory and Applications Workshop.
[8] David Declercq,et al. On the selection of finite alphabet iterative decoders for LDPC codes on the BSC , 2011, 2011 IEEE Information Theory Workshop.
[9] Marc P. C. Fossorier,et al. Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices , 2004, IEEE Trans. Inf. Theory.
[10] R. M. Tanner,et al. A Class of Group-Structured LDPC Codes , 2001 .
[11] P. Vontobel,et al. Graph-covers and iterative decoding of nite length codes , 2003 .
[12] B. Vasic,et al. Trapping set ontology , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[13] Shashi Kiran Chilappagari,et al. LDPC codes which can correct three errors under iterative decoding , 2008, 2008 IEEE Information Theory Workshop.
[14] Deepak Sridhara,et al. Pseudocodewords of Tanner Graphs , 2005, IEEE Transactions on Information Theory.
[15] David Declercq,et al. Trapping set enumerators for specific LDPC codes , 2010, 2010 Information Theory and Applications Workshop (ITA).
[16] Shashi Kiran Chilappagari,et al. An Efficient Instanton Search Algorithm for LP Decoding of LDPC Codes Over the BSC , 2011, IEEE Transactions on Information Theory.
[17] David Declercq,et al. Finite alphabet iterative decoding (FAID) of the (155,64,20) Tanner code , 2010, 2010 6th International Symposium on Turbo Codes & Iterative Information Processing.
[18] Shashi Kiran Chilappagari,et al. Error Floors of LDPC Codes on the Binary Symmetric Channel , 2006, 2006 IEEE International Conference on Communications.
[19] Thomas J. Richardson,et al. Error Floors of LDPC Codes , 2003 .
[20] David Declercq,et al. Improved impulse method to evaluate the low weight profile of sparse binary linear codes , 2008, 2008 IEEE International Symposium on Information Theory.
[21] David Declercq,et al. Finite alphabet iterative decoders for LDPC codes surpassing floating-point iterative decoders , 2011 .
[22] David Declercq,et al. Multilevel decoders surpassing belief propagation on the binary symmetric channel , 2010, 2010 IEEE International Symposium on Information Theory.
[23] David Declercq,et al. Finite Alphabet Iterative Decoders—Part I: Decoding Beyond Belief Propagation on the Binary Symmetric Channel , 2013, IEEE Transactions on Communications.