- Information length: \(k\)
- Code length: \(n\)
- Redundancy: \(n - k\)
- Information rate / Code rate: \(\frac{k}{n}\)
- Code: An image of an injective function \(\phi\) where \(\phi : B^k \to B^n\).
- Codeword: An element of \({\rm Im}\phi\).
\begin{align}
d{({x, y})} &=
\#{\left\{
j | {x_j \ne y_j}
\right\}} \\
\ &\text{where} \ {x,y \in B^n}
\end{align}