Title :
On the structure of Hermitian codes and decoding for burst errors
Author_Institution :
Dept. of Electr. & Comput. Eng., Michigan State Univ., East Lansing, MI, USA
Abstract :
In this paper, it is proved that Hermitian code is a direct sum of concatenated Reed-Solomon codes over GF(q2). Based on this discovery, first, a new method for computing the dimension and tightly estimating the minimum distance of the Hermitian code is derived. Secondly, a new decoding algorithm, which is especially effective in dealing with burst errors with complexity O(n53/), is described. Finally, some possible approaches for optimization of Hermitian codes are discussed.
Keywords :
Galois fields; Reed-Solomon codes; concatenated codes; decoding; error correction codes; minimisation; Galois fields; Hermitian code dimension; burst errors; complexity; concatenated Reed-Solomon codes; decoding; minimum distance estimation; optimization; Concatenated codes; Decoding; Error correction codes; Linear code; Poles and towers; Polynomials; Burst error; Hermitian code; Reed–Solomon code; concatenation; decoding algorithm;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2004.836918
