Content deleted Content added
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. |
adding list decoding, an important class of decoding algorithms, though my formatting is probably bad. |
||
Line 132:
The number of entries in the two lookup tables is <math>2^k+2^{n-k}</math>, which is significantly smaller than <math>2^n</math> required for [[standard array|standard array decoding]] that requires only <math>1</math> lookup. Additionally, the precomputed encoding lookup table can be used for the encoding, and is thus often useful to have.
== List decoding ==
{{Main|List decoding}}
== Information set decoding ==
| |||