Improved Power Decoding of One-Point Hermitian Codes
Information Theory
2017-03-24 v1 math.IT
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.
Keywords
Cite
@article{arxiv.1703.07982,
title = {Improved Power Decoding of One-Point Hermitian Codes},
author = {Sven Puchinger and Irene Bouw and Johan Rosenkilde né Nielsen},
journal= {arXiv preprint arXiv:1703.07982},
year = {2017}
}
Comments
9 pages, submitted to the International Workshop on Coding and Cryptography (WCC) 2017