ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let RnR_n be the squared Reed–Muller code matrix and Un=RnXnU^n=R_nX^n. Consider an index ii that is the last row in a degree layer of RnR_n, excluding the last layer; then i+1i+1 is the first row in the next layer.

Layer-crossing conjecture.

H(Ui∣Ui−1,Yn)≥H(Ui+1∣Ui,Yn).H(U_i\mid U^{i-1},Y^n)\ge H(U_{i+1}\mid U^i,Y^n).

Thus, conditional entropy should be non-decreasing when crossing from one degree layer to the next. By the symmetry of Reed–Muller codes, the source states that this conjecture implies the stronger twin-Reed–Muller ordering conjecture. It is presented as an open problem.

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.