Binary Goppa code: Difference between revisions

Content deleted Content added
Exaexa (talk | contribs)
one more ref, removed some of the issues
Exaexa (talk | contribs)
Line 5:
==Construction and properties==
 
Binary Goppa code is defined by a [[polynomial]] <math>g(x)</math> of degree <math>t</math> over a [[finite field]] <math>GF(2^m)</math> without multiple rootszeros, and a sequence <math>L</math> of <math>n</math> distinct elements from <math>GF(2^m)</math> that aren't roots of the polynomial:
 
<math>\forall i,j \in \mathbb{Z}_n: L_i \in GF(2^m) \and L_i \neq L_j \and g(L_i) \neq 0</math>