ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let RnR_n be the squared Reed–Muller code matrix, let Un=RnXnU^n=R_nX^n, and let AiA_i denote the degree layer associated with row ii. For indices i,jgin[n]i,j gin[n], write H(Ui∣Ui−1,Yn)H(U_i\mid U^{i-1},Y^n) for the corresponding conditional entropy.

Twin-Reed–Muller conjecture. The twin-Reed–Muller code is the Reed–Muller code; equivalently, for i,j∈[n]i,j\in[n],

∣Ai∣>∣Aj∣  ⟹  H(Ui∣Ui−1,Yn)≥H(Uj∣Uj−1,Yn).|A_i|>|A_j|\implies H(U_i\mid U^{i-1},Y^n)\ge H(U_j\mid U^{j-1},Y^n).

In words, conditional entropy should be non-decreasing as one moves to lower-degree layers. This conjecture would identify the capacity-achieving twin-Reed–Muller construction with the ordinary Reed–Muller code, thereby implying capacity achievement for Reed–Muller codes on every BMS channel. It remains open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.