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, we first prove that every Hermitian code is a direct sum of concatenated Reed-Solomon codes over GF(q2), which provides a new method to calculate the dimension of the Hermitian code. Based on this, we present a new decoding algorithm for Hermitian code. Our algorithm is especially efficient in decoding burst errors. Finally, a method to optimize Hermitian code is obtained. The optimized code maintains the same dimension and error correctability, but the complexity for burst error correction can be reduced from O(n53/) to O(n).
Keywords :
Galois fields; Reed-Solomon codes; algebraic geometric codes; concatenated codes; decoding; error correction codes; optimisation; GF(q2); Hermitian code; burst error correction; concatenated Reed-Solomon code; decoding algorithm; optimized code; Computer errors; Concatenated codes; Decoding; Equations; Error correction codes; Geometry; H infinity control; Linear code; Optimization methods; Reed-Solomon codes;
Conference_Titel :
Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE
Print_ISBN :
0-7803-7974-8
DOI :
10.1109/GLOCOM.2003.1258510
