On the structure of Hermitian codes and decoding for burst errors

Authors:
Jian Ren
Affiliations:
Dept. of Electr. & Comput. Eng., Michigan State Univ., East Lansing, MI, USA
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 2

Aggregate error locator and error value computation in AG codes

Journal of Combinatorial Theory Series A - Special issue in honor of Jacobus H. van Lint
Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes

Theoretical Computer Science

Quantified Score

Hi-index	754.84

Visualization

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.