Description
Decoder for binary Goppa codes whose defining polynomials are square free which uses Patterson decoding algorithm in order to correct errors in words.
The Patterson decoder makes use of the terminated extended Euclidean algorithm.
For further details see
N. Patterson: The algebraic decoding of Goppa codes, IEEE Transactions on Information Theory 21.2 (1975), pp. 203-207.
Johan S. H. Rosenkilde gave us a feedback on the first draft of this decoder and also suggested us possible reviewers.
So, we would like to thank him.
Component: coding theory
Keywords: coding theory, goppa codes, patterson decoder
Author: Giuseppe Cesare, Ferdinando Zullo
Branch/Commit: u/gh-giucesare/patterson_decoder @ e62cd8a
Reviewer: Xavier Caruso, Dima Pasechnik
Issue created by migration from https://trac.sagemath.org/ticket/31723