Reed-Muller Codes

Emmanuel Abbe, Ori Sberlo, Amir Shpilka, Min Ye*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

Reed-Muller (RM) codes are among the oldest, simplest and perhaps most ubiquitous family of codes. They are used in many areas of coding theory in both electrical engineering and computer science. Yet, many of their important properties are still under investigation. This work covers some of the developments regarding the weight enumerator and the capacity-achieving properties of RM codes, as well as some of the algorithmic developments. In particular, it discusses connections established between RM codes, thresholds of Boolean functions, polarization theory, hypercontractivity, and the techniques of approximating low weight codewords using lower degree polynomials (when codewords are viewed as evaluation vectors of degree r polynomials in m variables). It then overviews some of the algorithms for decoding RM codes, giving both algorithms with provable performance guarantees for every block length, as well as algorithms with state-of-the-art performances in practical regimes, which do not perform as well for large block length. Finally, some applications of RM codes in theoretical computer science and signal processing are given.

Original languageEnglish
Pages (from-to)1-156
Number of pages156
JournalFoundations and Trends in Communications and Information Theory
Volume20
Issue number1-2
DOIs
StatePublished - 2023

Funding

FundersFunder number
Blavatnik Family Foundation
European Research Council949499
Israel Science Foundation952/18, 514/20
National Key Research and Development Program of China2021YFA1001000, WDZC20220811170401001

    Fingerprint

    Dive into the research topics of 'Reed-Muller Codes'. Together they form a unique fingerprint.

    Cite this