Computer Science – Information Theory
Scientific paper
2007-12-11
Computer Science
Information Theory
10 pages, Submitted to ITW 2008 (with some minor modifications)
Scientific paper
We obtain a technique to reduce the computational complexity associated with decoding of Hermitian codes. In particular, we propose a method to compute the error locations and values using an uni-variate error locator and an uni-variate error evaluator polynomial. To achieve this, we introduce the notion of Semi-Erasure Decoding of Hermitian codes and prove that decoding of Hermitian codes can always be performed using semi-erasure decoding. The central results are: * Searching for error locations require evaluating an univariate error locator polynomial over $q^2$ points as in Chien search for Reed-Solomon codes. * Forney's formula for error value computation in Reed-Solomon codes can directly be applied to compute the error values in Hermitian codes. The approach develops from the idea that transmitting a modified form of the information may be more efficient that the information itself.
No associations
LandOfFree
On Computation of Error Locations and Values in Hermitian Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On Computation of Error Locations and Values in Hermitian Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Computation of Error Locations and Values in Hermitian Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-474588