Redundancies of Correction-Capability-Optimized Reed-Muller Codes
Information Theory
2007-07-16 v1 Discrete Mathematics
math.IT
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.
Keywords
Cite
@article{arxiv.cs/0609160,
title = {Redundancies of Correction-Capability-Optimized Reed-Muller Codes},
author = {Maria Bras-Amorós and Michael E. O'Sullivan},
journal= {arXiv preprint arXiv:cs/0609160},
year = {2007}
}