Binary Goppa code: Difference between revisions

Revision as of 12:56, 21 February 2013

Revision as of 18:53, 25 May 2013

Line 36:

==Decoding==

Decoding of binary Goppa codes is traditionalytraditionally done by Patterson algorithm, which gives good error-correcting capability (it corrects all <math>t</math> design errors), and is also fairly simple to implement.

Patterson algorithm converts a syndrome to a vector of errors. The syndrome of a word <math>c=(c_0,\dots,c_{n-1})</math> is expected to take a form of