Reed–Muller Codes: Distance Distribution

• Distance Distribution of Reed–Muller Codes is the enumeration of codewords by Hamming weight, revealing the combinatorial structure and error-correcting capabilities.
• The methodology leverages recursive constructions like the (u, u+v)-technique and derivative methods to precisely characterize weight spectra in various regimes.
• Asymptotic analyses and probabilistic bounds, including binomial approximations, offer practical insights into weight plateaus and performance limits in large finite fields.

A Reed–Muller code is a family of linear codes with broad significance in both theoretical and applied coding theory, combinatorics, and computer science. The distance distribution—also known as the weight spectrum—of a Reed–Muller code refers to the enumeration of codewords by their Hamming weights, providing a precise profile of the code's combinatorial structure and its error-correcting performance. The study of distance distributions includes exact characterizations for certain parameter regimes, asymptotic error bounds, the structure of small-weight codewords, and unified frameworks for codes over various finite fields.

1. Fundamental Definitions and Notation

Let $\mathbb{F}_q$ denote the finite field with $q$ elements. For integers $0 \leq r \leq m$, the $q$-ary Reed–Muller code $\mathrm{RM}_q(r,m)$ consists of evaluation vectors of all $m$-variate polynomials of total degree at most $r$, with entries in $\mathbb{F}_q$, evaluated over the points of $\mathbb{F}_q^m$: $$\mathrm{RM}_q(r,m) = \left\{ \left(f(\alpha)\right)_{\alpha \in \mathbb{F}_q^m} \ \big| \ f \in \mathbb{F}_q[x_1,\ldots,x_m], \ \deg(f) \leq r \right\}$$ The parameters are:

• Length $q$0
• Dimension $q$1
• Minimum distance $q$2

For binary codes ($q$3), the weight (distance) spectrum $q$4 is the set of Hamming weights of all codewords in $q$5, and the weight enumerator $q$6 counts the number of codewords of weight $q$7.

2. Exact Weight Spectra: Families $q$8 and $q$9

Recent work establishes explicit formulas for the weight spectra of two infinite families: $0 \leq r \leq m$0 for $0 \leq r \leq m$1 and $0 \leq r \leq m$2 for $0 \leq r \leq m$3 (Carlet et al., 2023). The determination proceeds via induction on $0 \leq r \leq m$4 utilizing the $0 \leq r \leq m$5-construction:

• $0 \leq r \leq m$6, the setwise sum of all possible weights.

Weight spectrum for $0 \leq r \leq m$7 ($0 \leq r \leq m$8):

$0 \leq r \leq m$9

Equivalently,

$q$0

Weight spectrum for $q$1 ($q$2):

$q$3

Or equivalently,

$q$4

The proofs combine induction with exclusion of "forbidden holes" in the possible weight intervals, rigorously constrained by the Kasami–Tokura characterization:

• For weights in $q$5, the only allowable weights take the form $q$6 for integer $q$7.

Explicit computations confirm this structure for specific small codes, such as $q$8 and $q$9, whose complete spectra are tabulated (Carlet et al., 2023).

3. Structured Descriptions: Kasami–Tokura Bound and Forbidden Gaps

The interval $\mathrm{RM}_q(r,m)$0 is governed by the Kasami–Tokura theorem: only weights $\mathrm{RM}_q(r,m)$1, for suitable $\mathrm{RM}_q(r,m)$2, appear. As a result, the weight spectra of $\mathrm{RM}_q(r,m)$3 for fixed $\mathrm{RM}_q(r,m)$4 and large $\mathrm{RM}_q(r,m)$5 comprise:

• Isolated "small" weights fully prescribed by Kasami–Tokura
• Further isolated weights in $\mathrm{RM}_q(r,m)$6, governed by the Kasami–Tokura–Azumi (KT–A) classification for weights $\mathrm{RM}_q(r,m)$7
• A contiguous sequence of even weights ("central interval") in the middle
• Complements to $\mathrm{RM}_q(r,m)$8 of the isolated weights

For $\mathrm{RM}_q(r,m)$9, the above structure is completely determined. For $m$0, this remains conjectural.

4. Asymptotic and Probabilistic Bounds: Character-Sum Framework

A general asymptotic analysis of $m$1 over arbitrary finite fields is achieved via the character-sum method (Kolekar, 26 Jan 2026). For any received word $m$2 and $m$3, the coset-weight distribution $m$4 admits a binomial-approximation: $m$5 with an explicit error bound: $m$6 where $m$7 and $m$8 is polynomial in $m$9 and $r$0. For fixed $r$1 and $r$2, the ratio $r$3 uniformly in $r$4.

This character-sum framework generalizes previous results for Reed–Solomon codes (the $r$5 case) and reveals that, for large $r$6, the Reed–Muller distance distribution is sharply concentrated around the binomial estimate.

5. Global Weight Distribution: Plateaus and Combinatorial Structure

The cumulative weight distribution $r$7 and the multiplicities at given weights exhibit a "plateau" phenomenon (0811.2356):

• For each $r$8, the distribution $r$9 remains essentially constant in $\mathbb{F}_q$0, rising exponentially at the cutoff points $\mathbb{F}_q$1.
• For $\mathbb{F}_q$2, $\mathbb{F}_q$3.
• The asymptotics in each plateau obey $\mathbb{F}_q$4 as $\mathbb{F}_q$5 with $\mathbb{F}_q$6 fixed.

Upper and lower bounds for $\mathbb{F}_q$7 are established: $\mathbb{F}_q$8

$\mathbb{F}_q$9

for constants $\mathbb{F}_q^m$0, $\mathbb{F}_q^m$1.

6. Techniques: $\mathbb{F}_q^m$2-Construction and Derivative Methods

The recursive $\mathbb{F}_q^m$3-construction underpins the inductive computation of spectra. For $\mathbb{F}_q^m$4, each codeword can be written as $\mathbb{F}_q^m$5 with $\mathbb{F}_q^m$6, $\mathbb{F}_q^m$7. This implies $\mathbb{F}_q^m$8, tightly constraining possible weights.

For asymptotic upper bounds and plateaus, the discrete derivative method is central (0811.2356). Mapping Boolean codewords into $\mathbb{F}_q^m$9, repeated application of directional differences $$\mathrm{RM}_q(r,m) = \left\{ \left(f(\alpha)\right)_{\alpha \in \mathbb{F}_q^m} \ \big| \ f \in \mathbb{F}_q[x_1,\ldots,x_m], \ \deg(f) \leq r \right\}$$0 uncovers bias and allows for representations of low-weight words via a controlled number of derivatives, bounding the number of possible codewords at each weight level.

On the enumeration side, the character-sum approach utilizes:

• Lagrange-indicator polynomials for zero-set specification
• Additive and multiplicative characters on the quotient algebra of polynomials to enforce coefficient constraints
• Evaluation of Gauss sums and Möbius-inversion to control error terms, combined with the Li–Wan permutation sieve for distinctness in summations (Kolekar, 26 Jan 2026)

7. Open Problems and Conjectural Spectra

For the general family $$\mathrm{RM}_q(r,m) = \left\{ \left(f(\alpha)\right)_{\alpha \in \mathbb{F}_q^m} \ \big| \ f \in \mathbb{F}_q[x_1,\ldots,x_m], \ \deg(f) \leq r \right\}$$1 with $$\mathrm{RM}_q(r,m) = \left\{ \left(f(\alpha)\right)_{\alpha \in \mathbb{F}_q^m} \ \big| \ f \in \mathbb{F}_q[x_1,\ldots,x_m], \ \deg(f) \leq r \right\}$$2 fixed and $$\mathrm{RM}_q(r,m) = \left\{ \left(f(\alpha)\right)_{\alpha \in \mathbb{F}_q^m} \ \big| \ f \in \mathbb{F}_q[x_1,\ldots,x_m], \ \deg(f) \leq r \right\}$$3, it is conjectured that the weight spectrum consists precisely of:

• Isolated gaps at small weights as predicted by Kasami–Tokura and KT–A results
• A single run of consecutive even weights ("central interval") in the middle
• Complements to $$\mathrm{RM}_q(r,m) = \left\{ \left(f(\alpha)\right)_{\alpha \in \mathbb{F}_q^m} \ \big| \ f \in \mathbb{F}_q[x_1,\ldots,x_m], \ \deg(f) \leq r \right\}$$4 of the exceptional weights

This conjecture remains open for $$\mathrm{RM}_q(r,m) = \left\{ \left(f(\alpha)\right)_{\alpha \in \mathbb{F}_q^m} \ \big| \ f \in \mathbb{F}_q[x_1,\ldots,x_m], \ \deg(f) \leq r \right\}$$5 (Carlet et al., 2023). The rigorous study of the coset-weight distribution for codes over large finite fields is now addressed systematically, but extensions to higher $$\mathrm{RM}_q(r,m) = \left\{ \left(f(\alpha)\right)_{\alpha \in \mathbb{F}_q^m} \ \big| \ f \in \mathbb{F}_q[x_1,\ldots,x_m], \ \deg(f) \leq r \right\}$$6, detailed spectra for nonbinary codes, and explicit combinatorial characterizations in the intermediate regime remain active topics.

---

Key References:

• "The weight spectrum of two families of Reed–Muller codes" (Carlet et al., 2023)
• "On the Distance Distribution of Reed–Muller Codes" (Kolekar, 26 Jan 2026)
• "The List-Decoding Size of Reed-Muller Codes" (0811.2356)