Reed-Muller Codes: Theory and Algorithms

02/09/2020
by   Emmanuel Abbe, et al.
0

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 paper covers some of the recent developments regarding the weight enumerator and the capacity-achieving properties of RM codes, as well as some of the algorithmic developments. In particular, the paper discusses the recent connections established between RM codes, thresholds of Boolean functions, polarization theory, hypercontractivity, and the techniques of approximating low weight codewords using lower degree polynomials. It then overviews some of the algorithms with performance guarantees, as well as some of the algorithms with state-of-the-art performances in practical regimes. Finally, the paper concludes with a few open problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/22/2021

Polycyclic Codes Associated with Trinomials: Good Codes and Open Questions

Polycyclic codes are a generalization of cyclic and constacyclic codes. ...
research
01/26/2019

Steiner systems S(2, 4, 3^m-1/2) and 2-designs from ternary linear codes of length 3^m-1/2

Coding theory and t-designs have close connections and interesting inter...
research
06/13/2023

Weight hierarchies of 3-weight linear codes from two p-ary quadratic functions

The weight hierarchy of a linear code has been an important research top...
research
04/10/2020

A Novel Application of Boolean Functions with High Algebraic Immunity in Minimal Codes

Boolean functions with high algebraic immunity are important cryptograph...
research
11/09/2020

On the hardness of code equivalence problems in rank metric

In recent years, the notion of rank metric in the context of coding theo...
research
12/30/2017

Vectorial Boolean functions and linear codes in the context of algebraic attacks

In this paper we study the relationship between vectorial (Boolean) func...
research
02/13/2019

CSPs with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations

We study the complexity of Boolean constraint satisfaction problems (CSP...

Please sign up or login with your details

Forgot password? Click here to reset