Hermitian codes belong to a powerful class of algebraic geometry codes, which allow to correct many independent errors. In this thesis it is shown that Hermitian codes can correct many burst of errors as well.
In this case, decoding of a Hermitian code is reduced to decoding of interleaved extended Reed-Solomon codes. Using this fact, an efficient decoding algorithm is presented and analyzed in the thesis. It is also shown that low rate Hermitian codes can correct more bursts of errors using "power" decoding.