| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 420513 | Discrete Applied Mathematics | 2008 | 6 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Maria Bras-Amorós, Michael E. O’Sullivan,