Improved decoding of affine-variety codes

Details Improved decoding of affine-variety codes Improved decoding of affine-variety codes

2011-02-21

arxiv.org/abs/1102.4186v3

Mathematics

Commutative Algebra

Scientific paper

General error locator polynomials are polynomials able to decode any correctable syndrome for a given linear code. Such polynomials are known to exist for all cyclic codes and for a large class of linear codes. We provide some decoding techniques for affine-variety codes using some multidimensional extensions of general error locator polynomials. We prove the existence of such polynomials for any correctable affine-variety code and hence for any linear code. We propose two main different approaches, that depend on the underlying geometry. We compute some interesting cases, including Hermitian codes. To prove our coding theory results, we develop a theory for special classes of zero-dimensional ideals, that can be considered generalizations of stratified ideals. Our improvement with respect to stratified ideals is twofold: we generalize from one variable to many variables and we introduce points with multiplicities.

Affiliated with

Also associated with

No associations

Rating

Improved decoding of affine-variety 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 Improved decoding of affine-variety codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved decoding of affine-variety codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-520405