Power Error Locating Pairs

07/26/2019

∙

by   Alain Couvreur, et al.

∙

0

∙

share

We present a new decoding algorithm based on error locating pairs and correcting an amount of errors exceeding the half minimum distance. This algorithm applies to Reed--Solomon codes, algebraic geometry codes and any other code benefiting from an error correcting pair. When applied to Reed--Solomon or algebraic geometry codes, the algorithm's decoding radius turns out to be the same as Sudan's or power decoding algorithm. Similarly to power decoding it boils down to linear algebra, returns at most one solution and might fail in some rare cases. On the other hand it presents the advantage to have a smaller space and time complexity than power decoding.