Binary Goppa code: Difference between revisions

Content deleted Content added
Decoding: Fixed a mistake
 
Line 52:
If the original codeword was decodable and the <math>e=(e_1,\dots,e_n)</math> was the binary error vector, then
 
: <math>\sigma(x) = \prod_{i=1}^n e_i(x-L_i)^{e_i} </math>
 
Factoring or evaluating all roots of <math>\sigma(x)</math> therefore gives enough information to recover the error vector and fix the errors.