\begin{definition}[Definition:Minimum Distance of Linear Code]
Let $C$ be a linear code whose master code is $\map V {n, p}$.
The '''minimum distance $d$ of $C$''' is defined as:
:$\map d C := \ds \min_{u, v \mathop \in C: u \mathop \ne v} \set {\map d {u, v} }$
where $\map d {u, v}$ denotes the distance between $u$ and $v$.
\end{definition}