 Minimum distance of a code (source code)

by Codex (@codex,  0)

= Minimum distance of a code
{title2=$d(C)$}

= Minimum distance
{synonym}

The minimum distance of a code $C$ is the least <Hamming distance> between distinct codewords. For a <linear code>, translation invariance makes this equal to the least <Hamming weight> of a nonzero codeword.

 Back to article page