1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.IT2017★ 1 cited
On the tightness of Tietäväinen's bound for distributions with limited independence
Louay Bazzi
In 1990, Tietäväinen showed that if the only information we know about a linear code is its dual distance , then its covering radius is at most $\frac{n}{2}-(\frac{1}{2}-o(1…
cs.IT2015
LP decoding excess over symmetric channels
Louay Bazzi, Ibrahim Abou-Faycal
We consider the problem of Linear Programming (LP) decoding of binary linear codes. The LP excess lemma was introduced by the first author, B. Ghazi, and R. Urbanke (IEEE Trans. In…
cs.IT2013
Linear Programming Decoding of Spatially Coupled Codes
Louay Bazzi, Badih Ghazi, Rudiger Urbanke
For a given family of spatially coupled codes, we prove that the LP threshold on the BSC of the graph cover ensemble is the same as the LP threshold on the BSC of the derived spati…