Weighted Reed-Muller codes revisited

Details Weighted Reed-Muller codes revisited Weighted Reed-Muller codes revisited

2011-08-31

arxiv.org/abs/1108.6185v1

Computer Science

Information Theory

29 pages, 2 figures, 4 tables

Scientific paper

We consider weighted Reed-Muller codes over point ensemble $S_1 \times...\times S_m$ where $S_i$ needs not be of the same size as $S_j$. For $m = 2$ we determine optimal weights and analyze in detail what is the impact of the ratio $|S_1|/|S_2|$ on the minimum distance. In conclusion the weighted Reed-Muller code construction is much better than its reputation. For a class of affine variety codes that contains the weighted Reed-Muller codes we then present two list decoding algorithms. With a small modification one of these algorithms is able to correct up to 31 errors of the [49, 11, 28] Joyner code.

Affiliated with

Also associated with

No associations

Rating

Weighted Reed-Muller codes revisited 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 Weighted Reed-Muller codes revisited, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Weighted Reed-Muller codes revisited will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-625593