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 $d$, then its covering radius $R$ is at most $\frac{n}{2}-(\frac{1}{2}-o(1…