The goal of the present paper is the derivation of a framework for the finite-length analysis of
message-passing iterative decoding of low-density parity-check codes. To this end we …

In this paper, we propose a new linear programming formulation for the decoding of general
linear block codes. Different from the original formulation given by Feldman, the number of …

In linear programming (LP) decoding of a low-density parity-check (LDPC) code one
minimizes a linear functional, with coefficients related to log-likelihood ratios, over a …

In this correspondence, we study the minimum pseudoweight and minimum
pseudocodewords of low-density parity-check (LDPC) codes under linear programming (LP) …

In this paper, a method to search the set of syndromes' indices needed in computing the
unknown syndromes for the (73, 37, 13) quadratic residue (QR) code is proposed. According …

Iterative message-passing decoders for low-density parity-check (LDPC) block codes are
known to be subject to decoding failures due to so-called pseudo-codewords. These failures …

Whereas many results are known about thresholds for ensembles of low-density parity-
check codes under message-passing iterative decoding, this is not the case for linear …

In this paper, we study the minimum pseudo-weight and minimum pseudo-codewords of low-
density parity-check (LDPC) codes under linear programming (LP) decoding. First, we show …

We would like to better understand the fundamental cone of Tanner graphs derived from
finite projective planes. Towards this goal, we discuss bounds on the AWGNC and BSC …

Rn of the points in {0, 1} n corresponding to the codewords of a binary linear code. This
paper contains a collection of results concerning the structure of such code polytopes. A …