Solving the key equation for Hermitian codes with a division algorithm
Sabine Kampf, Martin Bossert, Irene I. Bouw · 2011
This paper presents a division algorithm to solve the key equation for Hermitian codes, which is capable of locating most error patterns with weight up to half the designed minimum distance. The algorithm has a structure similar to the Euclidean algorithm used in the decoding of Reed-Solomon codes, yet it is a little more complex because bivariate polynomials have to be used. We give simulation results for the decoding of several Hermitian codes of various rates over the finite field GF(24) to verify the claims.