Reweighted LP Decoding for LDPC Codes
暂无分享,去创建一个
[1] David L. Donoho,et al. High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension , 2006, Discret. Comput. Geom..
[2] Xiaoming Huo,et al. Uncertainty principles and ideal atomic decomposition , 2001, IEEE Trans. Inf. Theory.
[3] Jon Feldman,et al. Decoding error-correcting codes via linear programming , 2003 .
[4] Ralf Koetter,et al. Towards Low-Complexity Linear-Programming Decoding , 2006, ArXiv.
[5] Paul H. Siegel,et al. Adaptive Linear Programming Decoding , 2006, 2006 IEEE International Symposium on Information Theory.
[6] R. DeVore,et al. Compressed sensing and best k-term approximation , 2008 .
[7] Weiyu Xu,et al. Improved sparse recovery thresholds with two-step reweighted ℓ1 minimization , 2010, 2010 IEEE International Symposium on Information Theory.
[8] Faramarz Fekri,et al. On decoding of low-density parity-check codes over the binary erasure channel , 2004, IEEE Transactions on Information Theory.
[9] Alexandros G. Dimakis,et al. LP decoding meets LP decoding: A connection between channel coding and compressed sensing , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[10] Alexandros G. Dimakis,et al. Probabilistic Analysis of Linear Programming Decoding , 2007, IEEE Transactions on Information Theory.
[11] Marc P. C. Fossorier,et al. Iterative reliability-based decoding of low-density parity check codes , 2001, IEEE J. Sel. Areas Commun..
[12] Sanjeev Arora,et al. Message-Passing Algorithms and Improved LP Decoding , 2009, IEEE Transactions on Information Theory.
[13] Stephen P. Boyd,et al. Enhancing Sparsity by Reweighted ℓ1 Minimization , 2007, 0711.1612.
[14] Stark C. Draper,et al. ML decoding via mixed-integer adaptive linear programming , 2007, 2007 IEEE International Symposium on Information Theory.
[15] Ron Shamir,et al. Probabilistic Analysis in Linear Programming , 1993 .
[16] Martin J. Wainwright,et al. MAP estimation via agreement on (hyper)trees: Message-passing and linear programming , 2005, ArXiv.
[17] Martin J. Wainwright,et al. Linear Programming-Based Decoding of Turbo-Like Codes and its Relation to Iterative Approaches , 2002 .
[18] Emmanuel J. Candès,et al. Decoding by linear programming , 2005, IEEE Transactions on Information Theory.
[19] D. Donoho,et al. Neighborliness of randomly projected simplices in high dimensions. , 2005, Proceedings of the National Academy of Sciences of the United States of America.
[20] Martin J. Wainwright,et al. LP Decoding Corrects a Constant Fraction of Errors , 2004, IEEE Transactions on Information Theory.
[21] Martin J. Wainwright,et al. Using linear programming to Decode Binary linear codes , 2005, IEEE Transactions on Information Theory.
[22] Alexandros G. Dimakis,et al. LDPC Codes for Compressed Sensing , 2010, IEEE Transactions on Information Theory.
[23] Weiyu Xu,et al. Compressed sensing - probabilistic analysis of a null-space characterization , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.
[24] P. Vontobel,et al. Graph-covers and iterative decoding of nite length codes , 2003 .
[25] Jon Feldman,et al. Nonlinear programming approaches to decoding low-density parity-check codes , 2006, IEEE Journal on Selected Areas in Communications.
[26] Martin J. Wainwright,et al. MAP estimation via agreement on trees: message-passing and linear programming , 2005, IEEE Transactions on Information Theory.
[27] Alexandros G. Dimakis,et al. Guessing Facets: Polytope Structure and Improved LP Decoder , 2009, IEEE Transactions on Information Theory.
[28] Weiyu Xu,et al. On sharp performance bounds for robust sparse signal recoveries , 2009, 2009 IEEE International Symposium on Information Theory.