2017/03/23 by Sven Puchinger, Irene I. Bouw, Puchinger, Sven +2
Computer Science · Engineering · #Coding theory and cryptography #Cryptographic Implementations and Security #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1703.07982
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.