52 citations · 106 across the 21 of their papers we have counts for
6 papers · 1 filter
Deterministic Rateless Codes for BSC
Benny Applebaum, Liron David, Guy Even
A rateless code encodes a finite length information word into an infinitely long codeword such that longer prefixes of the codeword can tolerate a larger fraction of errors. A rate…
Analysis of the Min-Sum Algorithm for Packing and Covering Problems via Linear Programming
Guy Even, Nissim Halabi
Message-passing algorithms based on belief-propagation (BP) are successfully used in many applications including decoding error correcting codes and solving constraint satisfaction…
Local-Optimality Guarantees for Optimal Decoding Based on Paths
Guy Even, Nissim Halabi
This paper presents a unified analysis framework that captures recent advances in the study of local-optimality characterizations for codes on graphs. These local-optimality charac…
Hierarchies of Local-Optimality Characterizations in Decoding of Tanner Codes
Nissim Halabi, Guy Even
Recent developments in decoding of Tanner codes with maximum-likelihood certificates are based on a sufficient condition called local-optimality. We define hierarchies of locally-o…
On Decoding Irregular Tanner Codes with Local-Optimality Guarantees
Nissim Halabi, Guy Even
We consider decoding of binary Tanner codes using message-passing iterative decoding and linear programming (LP) decoding in MBIOS channels. We present new certificates that are ba…
Local Optimality Certificates for LP Decoding of Tanner Codes
Nissim Halabi, Guy Even
We present a new combinatorial characterization for local optimality of a codeword in an irregular Tanner code. The main novelty in this characterization is that it is based on a l…