Content deleted Content added
Matthiaspaul (talk | contribs) →References: fixed name |
m The set of possible errors in a binary code is not strictly smaller than \abs{C}, consider e.g. the repetition code. The lookup table only becomes smaller compared to the full standard array of the code. |
||
Line 115:
:<math>
\begin{matrix}
\sum_{i=0}^t \binom{n}{i}
\end{matrix}
</math>
Knowing what <math>e</math> is, it is then trivial to decode <math>x</math> as:
| |||