11G
= 11G
{scope}
{title2=Coding and Cryptography}
A binary <linear code> of length $n$ and rank $k$ is a $k$-dimensional vector subspace $C\leq\mathbb F_2^n$. Its minimum distance $d$ is the least <Hamming weight> of a nonzero codeword, equivalently the least <Hamming distance> between distinct codewords.