Binary Goppa code: Difference between revisions

Revision as of 05:58, 2 March 2014

Revision as of 18:55, 4 December 2015

Line 32:

Note that this form of the parity-check matrix, being composed of a [[Vandermonde matrix]] <math>V</math> and [[diagonal matrix]] <math>D</math>, shares the form with check matrices of [[alternant code]]s, thus alternant decoders can be used on this form. Such decoders usually provide only limited error-correcting capability (in most cases <math>t/2</math>).

For practical purposes, parity-check matrix of a binary Goppa code is usually converted to a more computer-friendly binary form by a trace construction, that converts the <math>t</math>-by-<math>n</math> matrix over <math>GF(2^m)</math> to a <math>mt</math>-by-<math>n</math> binary matrix by writing polynomial cofficientscoefficients of <math>GF(2^m)</math> elements on <math>m</math> successive rows.

==Decoding==