On the Joint Error-and-Erasure Decoding for Irreducible Polynomial Remainder Codes

Details On the Joint Error-and-Erasure Decoding for Irreducible Polynomial Remainder Codes On the Joint Error-and-Erasure Decoding for Irreducible Polynomial Remainder Codes

2012-02-24

arxiv.org/abs/1202.5413v1

Computer Science

Information Theory

Submitted (on 03/Feb/2012) to 2012 IEEE International Symposium on Information Theory

Scientific paper

A general class of polynomial remainder codes is considered. Such codes are very flexible in rate and length and include Reed-Solomon codes as a special case. As an extension of previous work, two joint error-and-erasure decoding approaches are proposed. In particular, both the decoding approaches by means of a fixed transform are treated in a way compatible with the error-only decoding. In the end, a collection of gcd-based decoding algorithm is obtained, some of which appear to be new even when specialized to Reed-Solomon codes.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-78379