The ADMM Penalized Decoder for LDPC Codes
暂无分享,去创建一个
[1] P. Vontobel,et al. Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes , 2005, ArXiv.
[2] Alexandros G. Dimakis,et al. Guessing Facets: Polytope Structure and Improved LP Decoder , 2009, IEEE Transactions on Information Theory.
[3] Bane V. Vasic,et al. Diagnosis of weaknesses in modern error correction codes: a physics approach , 2005, Physical review letters.
[4] William Ryan,et al. Channel Codes by William Ryan , 2009 .
[5] Frank Kienle,et al. A Separation Algorithm for Improved LP-Decoding of Linear Block Codes , 2008, IEEE Transactions on Information Theory.
[6] Yurii Nesterov,et al. Random Gradient-Free Minimization of Convex Functions , 2015, Foundations of Computational Mathematics.
[7] Carlo Fischione,et al. On the convergence of an alternating direction penalty method for nonconvex problems , 2014, 2014 48th Asilomar Conference on Signals, Systems and Computers.
[8] 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.
[9] Akin Tanatmis,et al. Mathematical Programming Decoding of Binary Linear Codes: Theory and Algorithms , 2011, IEEE Transactions on Information Theory.
[10] Paul H. Siegel,et al. Error floor approximation for LDPC codes in the AWGN channel , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[11] Stark C. Draper,et al. ADMM decoding on trapping sets , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).
[12] R. Tibshirani. Regression Shrinkage and Selection via the Lasso , 1996 .
[13] Sanjeev Arora,et al. Message-Passing Algorithms and Improved LP Decoding , 2009, IEEE Transactions on Information Theory.
[14] Stark C. Draper,et al. Hierarchical and High-Girth QC LDPC Codes , 2011, IEEE Transactions on Information Theory.
[15] Stephen P. Boyd,et al. Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..
[16] William Ryan,et al. Channel Codes: Classical and Modern , 2009 .
[17] Misha Stepanov,et al. Instantons causing iterative decoding to cycle , 2011, ArXiv.
[18] Richard Heusdens,et al. Large Scale LP Decoding with Low Complexity , 2013, IEEE Communications Letters.
[19] Alexandros G. Dimakis,et al. Probabilistic Analysis of Linear Programming Decoding , 2007, IEEE Transactions on Information Theory.
[20] Pascal O. Vontobel,et al. Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function , 2010, IEEE Transactions on Information Theory.
[21] Stark C. Draper,et al. The l1 penalized decoder and its reweighted LP , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[22] Nate Derbinsky,et al. An Improved Three-Weight Message-Passing Algorithm , 2013, ArXiv.
[23] Badih Ghazi,et al. Linear programming decoding of spatially coupled codes , 2013, 2013 IEEE International Symposium on Information Theory.
[24] David J. C. MacKay,et al. Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check cCodes , 2003, MFCSIT.
[25] Paul H. Siegel,et al. Efficient iterative LP decoding of LDPC codes with alternating direction method of multipliers , 2013, 2013 IEEE International Symposium on Information Theory.
[26] Martin J. Wainwright,et al. LP Decoding Corrects a Constant Fraction of Errors , 2004, IEEE Transactions on Information Theory.
[27] Guy Even,et al. LP Decoding of Regular LDPC Codes in Memoryless Channels , 2010, IEEE Transactions on Information Theory.
[28] Michael Chertkov,et al. Polytope of correct (linear programming) decoding and low-weight pseudo-codewords , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.
[29] Paul H. Siegel,et al. Efficient implementation of linear programming decoding , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.
[30] Paul H. Siegel,et al. Adaptive Methods for Linear Programming Decoding , 2008, IEEE Transactions on Information Theory.
[31] Shu Lin,et al. Channel Codes: Classical and Modern , 2009 .
[32] Stephen P. Boyd,et al. Enhancing Sparsity by Reweighted ℓ1 Minimization , 2007, 0711.1612.
[33] David J. C. MacKay,et al. Encyclopedia of Sparse Graph Codes , 1999 .
[34] Stark C. Draper,et al. Multi-stage decoding of LDPC codes , 2009, 2009 IEEE International Symposium on Information Theory.
[35] Ralf Koetter,et al. Towards Low-Complexity Linear-Programming Decoding , 2006, ArXiv.
[36] Stark C. Draper,et al. Suppressing pseudocodewords by penalizing the objective of LP decoding , 2012, 2012 IEEE Information Theory Workshop.
[37] David Burshtein,et al. Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance , 2010, IEEE Transactions on Information Theory.
[38] Shashi Kiran Chilappagari,et al. Instanton-based techniques for analysis and reduction of error floors of LDPC codes , 2009, IEEE Journal on Selected Areas in Communications.
[39] Paul H. Siegel,et al. Adaptive Cut Generation Algorithm for Improved Linear Programming Decoding of Binary Linear Codes , 2011, IEEE Transactions on Information Theory.
[40] Aaas News,et al. Book Reviews , 1893, Buffalo Medical and Surgical Journal.
[41] Tjalling J. Ypma,et al. Historical Development of the Newton-Raphson Method , 1995, SIAM Rev..
[42] Michael Chertkov,et al. An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes , 2006, IEEE Transactions on Information Theory.
[43] Stark C. Draper,et al. ML decoding via mixed-integer adaptive linear programming , 2007, 2007 IEEE International Symposium on Information Theory.
[44] Alexandros G. Dimakis,et al. Reweighted LP Decoding for LDPC Codes , 2010, IEEE Transactions on Information Theory.
[45] 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.
[46] Martin J. Wainwright,et al. Using linear programming to Decode Binary linear codes , 2005, IEEE Transactions on Information Theory.
[47] W. Marsden. I and J , 2012 .
[48] Rüdiger L. Urbanke,et al. Modern Coding Theory , 2008 .
[49] David Burshtein,et al. Iterative Approximate Linear Programming Decoding of LDPC Codes With Linear Complexity , 2008, IEEE Transactions on Information Theory.
[50] Chao Chen,et al. Improved ADMM Penalized Decoder for Irregular Low-Density Parity-Check Codes , 2015, IEEE Communications Letters.
[51] R. M. Tanner,et al. A Class of Group-Structured LDPC Codes , 2001 .
[52] Stark C. Draper,et al. Decomposition methods for large scale LP decoding , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[53] Asi Lifshitz,et al. Efficient Linear Programming Decoding of HDPC Codes , 2011, IEEE Trans. Commun..