Louay Bazzi

Orcid: 0000-0001-9859-3112

According to our database1, Louay Bazzi authored at least 17 papers between 1998 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
On the Covering Radius of Small Codes Versus Dual Distance.
IEEE Trans. Inf. Theory, 2019

2017
Corrections to "Weight Distribution of Cosets of Small Codes With Good Dual Properties".
IEEE Trans. Inf. Theory, 2017

On the tightness of Tietäväinen's bound for distributions with limited independence.
CoRR, 2017

2015
Impact of Redundant Checks on the LP Decoding Thresholds of LDPC Codes.
IEEE Trans. Inf. Theory, 2015

Weight Distribution of Cosets of Small Codes With Good Dual Properties.
IEEE Trans. Inf. Theory, 2015

LP Decoding Excess Over Symmetric Channels.
IEEE Commun. Lett., 2015

Entropy of weight distributions of small-bias spaces and pseudobinomiality.
Chic. J. Theor. Comput. Sci., 2015

2014
Linear Programming Decoding of Spatially Coupled Codes.
IEEE Trans. Inf. Theory, 2014

2013
Small-bias is not enough to hit read-once CNF.
Electron. Colloquium Comput. Complex., 2013

2009
The Minimum Distance of Turbo-Like Codes.
IEEE Trans. Inf. Theory, 2009

Polylogarithmic Independence Can Fool DNF Formulas.
SIAM J. Comput., 2009

2005
Endcoding complexity versus minimum distance.
IEEE Trans. Inf. Theory, 2005

2004
Exact Thresholds and Optimal Codes for the Binary-Symmetric Channel and Gallager's Decoding Algorithm A.
IEEE Trans. Inf. Theory, 2004

2003
Minimum distance of error correcting codes versus encoding complexity, symmetry, and pseudorandomness.
PhD thesis, 2003

The Solution of Linear Probabilistic Recurrence Relations.
Algorithmica, 2003

1999
Sampling of Images for Efficient Model-Based Vision.
IEEE Trans. Pattern Anal. Mach. Intell., 1999

1998
On the Solution of Linear Recurrence Equations.
Comput. Optim. Appl., 1998


  Loading...