Redundancies of Correction-Capability-Optimized Reed-Muller Codes
<|reference_start|>Redundancies of Correction-Capability-Optimized Reed-Muller Codes: 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.<|reference_end|>
@article{bras-amorós2006redundancies,
    title={Redundancies of Correction-Capability-Optimized Reed-Muller Codes},
    author={Maria Bras-Amor'os, Michael E. O'Sullivan},
    journal={arXiv preprint arXiv:cs/0609160},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0609160},
    primaryClass={cs.IT cs.DM math.IT}
}