The twin-Reed–Muller code equals the Reed–Muller code
Statement
Let be the squared Reed–Muller code matrix, let , and let denote the degree layer associated with row . For indices , write for the corresponding conditional entropy.
Twin-Reed–Muller conjecture. The twin-Reed–Muller code is the Reed–Muller code; equivalently, for ,
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.