Computer Science – Information Theory
Scientific paper
2006-09-29
Computer Science
Information Theory
Scientific paper
This article is focused on some variations of Reed-Muller codes that yield
improvements to the rate for a prescribed decoding performance under the
Berlekamp-Massey-Sakata algorithm with majority voting. Explicit formulas for
the redundancies of the new codes are given.
Bras-Amorós Maria
O'Sullivan Michael E.
No associations
LandOfFree
Redundancies of Correction-Capability-Optimized Reed-Muller 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 Redundancies of Correction-Capability-Optimized Reed-Muller Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Redundancies of Correction-Capability-Optimized Reed-Muller Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-184250