Zobrazeno 1 - 10
of 64
pro vyhledávání: '"Bazzi, Louay"'
Autor:
Bazzi, Louay
Tiet\"{a}v\"{a}inen's upper and lower bounds assert that for block-length-$n$ linear codes with dual distance $d$, the covering radius $R$ is at most $\frac{n}{2}-(\frac{1}{2}-o(1))\sqrt{dn}$ and typically at least $\frac{n}{2}-\Theta(\sqrt{dn\log{\f
Externí odkaz:
http://arxiv.org/abs/1707.06628
Autor:
Bazzi, Louay
In 1990, Tiet\"av\"ainen showed that if the only information we know about a linear code is its dual distance $d$, then its covering radius $R$ is at most $\frac{n}{2}-(\frac{1}{2}-o(1))\sqrt{dn}$. While Tiet\"av\"ainen's bound was later improved for
Externí odkaz:
http://arxiv.org/abs/1707.00552
Autor:
Bazzi, Louay, Abou-Faycal, Ibrahim
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. Inf. Th., 2014) as a technique to trade crossover probability for "LP ex
Externí odkaz:
http://arxiv.org/abs/1507.03395
Autor:
Bazzi, Louay, Audah, Hani
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, even if we include all redundant checks, asymptotically there is no gai
Externí odkaz:
http://arxiv.org/abs/1411.7554
Autor:
Bazzi, Louay
Publikováno v:
IEEE Transactions on Information Theory. Volume: 61, Issue: 12, Dec. 2015
The bilateral minimum distance of a binary linear code is the maximum $d$ such that all nonzero codewords have weights between $d$ and $n-d$. Let $Q\subset \{0,1\}^n$ be a binary linear code whose dual has bilateral minimum distance at least $d$, whe
Externí odkaz:
http://arxiv.org/abs/1408.5681
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 spatially coupled ensemble. This result is in contrast with the fact that t
Externí odkaz:
http://arxiv.org/abs/1301.6410
Autor:
Bazzi, Louay1 louay.bazzi@aub.edu.lb, Nahas, Nagi1
Publikováno v:
Theory of Computing Systems. Feb2017, Vol. 60 Issue 2, p324-345. 22p.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
BAZZI, LOUAY M. J.1 Louay.Bazzi@aub.edu.lb
Publikováno v:
SIAM Journal on Computing. 2009, Vol. 38 Issue 6, p2220-2272. 53p. 2 Charts.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.