1 citations · 1 across the 4 of their papers we have counts for
8 papers
Hardness of approximation for minimum-weight decoding of two-dimensional topological quantum codes
Louay Bazzi, Georges Khater
Efficient decoding is essential for the practical realization of fault-tolerant quantum computers. We study the computational complexity of minimum-weight decoding for topological…
Improved decoding algorithms for surface codes under independent bit-flip and phase-flip errors
Louay Bazzi
We study exact decoding for the toric code and for planar and rotated surface codes under the standard independent \(X/Z\) noise model, focusing on Separate Minimum Weight (SMW) de…
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…
On the covering radius of small codes versus dual distance
Louay Bazzi
Tietäväinen's upper and lower bounds assert that for block-length- linear codes with dual distance , the covering radius is at most $\frac{n}{2}-(\frac{1}{2}-o(1))\sqrt{d…
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…
Impact of redundant checks on the LP decoding thresholds of LDPC codes
Louay Bazzi, Hani Audah
Feldman et al.(2005) asked whether the performance of the LP decoder can be improved by adding redundant parity checks to tighten the LP relaxation. We prove that for LDPC codes, e…