Redundancies of Correction-Capability-Optimized Reed-Muller Codes
classification
💻 cs.IT
cs.DMmath.IT
keywords
codesredundanciesreed-mulleralgorithmarticleberlekamp-massey-sakatacorrection-capability-optimizeddecoding
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.