Error-correction capability of Reed-Muller codes

We present an asymptotic limit between correctable and uncorrectable errors on the Reed-Muller codes of any order and give its value. This limit is theoretical and does not depend on any decoding algorithm.

Saved in:
Bibliographic Details
Published inArithmetic, Geometry, Cryptography and Coding Theory Vol. 686; pp. 17 - 29
Main Authors Dib, Stéphanie, Rodier, François
Format Book Chapter
LanguageEnglish
Published Providence, Rhode Island American Mathematical Society
SeriesContemporary Mathematics
Online AccessGet full text
ISBN9781470428105
1470428105
ISSN0271-4132
1098-3627
DOI10.1090/conm/686/13775

Cover

More Information
Summary:We present an asymptotic limit between correctable and uncorrectable errors on the Reed-Muller codes of any order and give its value. This limit is theoretical and does not depend on any decoding algorithm.
ISBN:9781470428105
1470428105
ISSN:0271-4132
1098-3627
DOI:10.1090/conm/686/13775