Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of International Workshop on Coding and Cryptography 2017 |
| Number of pages | 9 |
| Publication date | 2017 |
| Publication status | Published - 2017 |
| Event | Tenth International Workshop on Coding and Cryptography 2017 - Saint-Petersburg, Russian Federation Duration: 18 Sept 2017 → 22 Sept 2017 |
Conference
| Conference | Tenth International Workshop on Coding and Cryptography 2017 |
|---|---|
| Country/Territory | Russian Federation |
| City | Saint-Petersburg |
| Period | 18/09/2017 → 22/09/2017 |