Singleton bound
= Singleton bound
{c}
{wiki}
For a code of length $n$, size $M$, and minimum distance $d$ over an alphabet of size $q$, puncturing $d-1$ coordinates gives the Singleton bound
$$
M\leq q^{n-d+1}.
$$
= Singleton bound
{c}
{wiki}
For a code of length $n$, size $M$, and minimum distance $d$ over an alphabet of size $q$, puncturing $d-1$ coordinates gives the Singleton bound
$$
M\leq q^{n-d+1}.
$$