3 problems

Let $d_v$ and $d_c$ be integers with $d_c>d_v\geq 3$. A Tanner graph is asymptotically strong if, for every constant $\beta>0$, there is a constant $\alpha>0$ such that its LP deco…

Let $\mathcal{E}$ be the set defined by the stated integer constraint lemma for $\mathbb{F}_{2^2}$ and by the all-ones check of length $d$. Let $\mathbb{U}_4$ be the relaxed code p…

The relaxed code polytope is constructed from the local constraints associated with non-binary single-parity-check codes over $\mathbb{F}_{2^2}$. A polytope is tight when it equals…