We propose a new partial decoding algorithm for one-point Hermitian codes that can decode up to the same number of errors as the Guruswami–Sudan decoder. Simulations suggest that it has a similar failure probability as the latter one. The algorithm is based on a recent generalization of the power decoding algorithm for Reed–Solomon codes and does not require an expensive root-finding step. In addition, it promises improvements for decoding interleaved Hermitian codes.
|Title of host publication||Proceedings of International Workshop on Coding and Cryptography 2017|
|Number of pages||9|
|Publication status||Published - 2017|
|Event||Tenth International Workshop on Coding and Cryptography 2017 - Saint-Petersburg, Russian Federation|
Duration: 18 Sep 2017 → 22 Sep 2017
|Conference||Tenth International Workshop on Coding and Cryptography 2017|
|Period||18/09/2017 → 22/09/2017|