Improved linear programming decoding of LDPC codes and bounds on the minimum and fractional distance

David Burshtein, Idan Goldenberg

We examine LDPC codes decoded using linear programming (LP). Four contributions to the LP framework are presented. First, a new method of tightening the LP relaxation, and thus imp…