On Polynomial Remainder Codes

Details On Polynomial Remainder Codes On Polynomial Remainder Codes

2012-01-09

arxiv.org/abs/1201.1812v1

Computer Science

Information Theory

Scientific paper

Polynomial remainder codes are a large class of codes derived from the Chinese remainder theorem that includes Reed-Solomon codes as a special case. In this paper, we revisit these codes and study them more carefully than in previous work. We explicitly allow the code symbols to be polynomials of different degrees, which leads to two different notions of weight and distance. Algebraic decoding is studied in detail. If the moduli are not irreducible, the notion of an error locator polynomial is replaced by an error factor polynomial. We then obtain a collection of gcd-based decoding algorithms, some of which are not quite standard even when specialized to Reed-Solomon codes.

Affiliated with

Also associated with

No associations

Rating

On Polynomial Remainder 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 Polynomial Remainder Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Polynomial Remainder Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-643623