Revision as of 08:44, 3 December 2019 edit 212.79.106.136 (talk) Fix mathematics. The condition for L and the syndrome+error locator polynomial computation were corrected to nonsense either by careless automatic edits or careless editors. ← Previous edit		Revision as of 02:02, 31 May 2020 edit undo Arturj (talk \| contribs) 55 edits m Removed "t = " from "t = ( ... formula involving t ... )". Next edit →
Line 11: : <math>\Gamma(g,L)=\left\{ c \in \{0,1\}^n \left\| \sum_{i=0}^{n-1} \frac{c_i}{x-L_i} \equiv 0 \mod g(x) \right. \right\}</math> Code defined by a tuple <math>(g,L)</math> has minimum distance <math>2t+1</math>, thus it can correct <math>t=\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>

Binary Goppa code: Difference between revisions