Iterative Approximate Linear Programming Decoding of LDPC Codes With Linear Complexity
暂无分享,去创建一个
[1] David Burshtein,et al. Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels , 2005, IEEE Transactions on Information Theory.
[2] D. Spielman,et al. Expander codes , 1996 .
[3] Daniel A. Spielman,et al. Efficient erasure correcting codes , 2001, IEEE Trans. Inf. Theory.
[4] Deepak Sridhara,et al. Eigenvalue bounds on the pseudocodeword weight of expander codes , 2007, Adv. Math. Commun..
[5] Tadashi Wadayama,et al. Interior Point Decoding for Linear Vector Channels Based on Convex Optimization , 2008, IEEE Transactions on Information Theory.
[6] Daniel A. Spielman,et al. Improved low-density parity-check codes using irregular graphs and belief propagation , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).
[7] Robert Michael Tanner,et al. A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.
[8] Martin J. Wainwright,et al. Using linear programming to Decode Binary linear codes , 2005, IEEE Transactions on Information Theory.
[9] Tadashi Wadayama. Interior point decoding for linear vector channels based on convex optimization , 2010, IEEE Trans. Inf. Theory.
[10] David Burshtein,et al. Expander graph arguments for message-passing algorithms , 2001, IEEE Trans. Inf. Theory.
[11] Ralf Koetter,et al. Towards Low-Complexity Linear-Programming Decoding , 2006, ArXiv.
[12] J. Boutros,et al. Generalized low density (Tanner) codes , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).
[13] Stephen P. Boyd,et al. Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.
[14] Alexandros G. Dimakis,et al. Probabilistic Analysis of Linear Programming Decoding , 2007, IEEE Transactions on Information Theory.
[15] R. Koetter,et al. On the Effective Weights of Pseudocodewords for Codes Defined on Graphs with Cycles , 2001 .
[16] Michael Lentmaier,et al. On generalized low-density parity-check codes based on Hamming component codes , 1999, IEEE Communications Letters.
[17] P. Vontobel,et al. Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes , 2005, ArXiv.
[18] Stark C. Draper,et al. ML decoding via mixed-integer adaptive linear programming , 2007, 2007 IEEE International Symposium on Information Theory.
[19] Alexandros G. Dimakis,et al. Guessing Facets: Polytope Structure and Improved LP Decoding , 2006, ISIT.
[20] Juntan Zhang,et al. Shuffled belief propagation decoding , 2002, Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002..
[21] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[22] H. Kfir,et al. Parallel versus sequential updating for belief propagation decoding , 2002, cond-mat/0207185.
[23] Pascal O. Vontobel,et al. Interior-point algorithms for linear-programming decoding , 2008, 2008 Information Theory and Applications Workshop.
[24] David Burshtein. Iterative approximate linear programming decoding of LDPC codes with linear complexity , 2009, IEEE Trans. Inf. Theory.
[25] Ralf Koetter,et al. On low-complexity linear-programming decoding of LDPC codes , 2007, Eur. Trans. Telecommun..
[26] William E. Ryan,et al. On Generalized LDPC Codes and Their Decoders , 2007 .
[27] David Burshtein,et al. On the Error Correction of Regular LDPC Codes Using the Flipping Algorithm , 2007, IEEE Transactions on Information Theory.
[28] Martin J. Wainwright,et al. Linear Programming-Based Decoding of Turbo-Like Codes and its Relation to Iterative Approaches , 2002 .
[29] D. Bertsekas. 6.253 Convex Analysis and Optimization, Spring 2010 , 2004 .
[30] Martin J. Wainwright,et al. LP Decoding Corrects a Constant Fraction of Errors , 2004, IEEE Transactions on Information Theory.
[31] Rüdiger L. Urbanke,et al. The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.
[32] Jon Feldman,et al. A New Linear Programming Approach to Decoding Linear Block Codes , 2008, IEEE Transactions on Information Theory.
[33] Jon Feldman,et al. Nonlinear programming approaches to decoding low-density parity-check codes , 2006, IEEE Journal on Selected Areas in Communications.
[34] A. Hoffman. On approximate solutions of systems of linear inequalities , 1952 .
[35] Uriel G. Rothblum,et al. Approximations to Solutions to Systems of Linear Inequalities , 1995, SIAM J. Matrix Anal. Appl..
[36] P. Vontobel,et al. On the Relationship between Linear Programming Decoding and Min-Sum Algorithm Decoding , 2004 .
[37] Imre Csiszár,et al. Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .
[38] Robert G. Jeroslow. On defining sets of vertices of the hypercube by linear inequalities , 1975, Discret. Math..
[39] Simon Litsyn,et al. Efficient Serial Message-Passing Schedules for LDPC Decoding , 2007, IEEE Transactions on Information Theory.
[40] Alexandros G. Dimakis,et al. Guessing Facets: Polytope Structure and Improved LP Decoder , 2009, IEEE Transactions on Information Theory.
[41] Paul H. Siegel,et al. Adaptive Methods for Linear Programming Decoding , 2008, IEEE Transactions on Information Theory.
[42] T. Wadayama. An Extension of Gallager Ensemble of Low Density Parity Check Codes , 2002, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..
[43] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.