Binary Goppa code: Difference between revisions

Content deleted Content added
Fixed off-by-one error in the definition
Line 9:
: <math>\Gamma(g,L)=\left\{ c \in \{0,1\}^n \left| \sum_{i=1}^{n} \frac{c_i}{x-L_i} \equiv 0 \mod g(x) \right. \right\}</math>
 
The code defined by a tuple <math>(g,L)</math> has dimension at least <math>n-mt</math> and
Codedistance definedat byleast a<math>2t+1</math>, tuplethus it can encode messages of length at least <math>(g,L)n-mt</math> hasusing minimumcodewords distanceof size <math>2t+1n</math>, thuswhile itcorrecting canat correctleast <math>\left\lfloor \frac{(2t+1)-1}{2} \right\rfloor</math> errors in a word of size <math>n-mt</math> using codewords of size <math>n</math>. It also possesses a convenient [[parity-check matrix]] <math>H</math> in form
 
: <math>