Layer-crossing conditional-entropy conjecture for Reed–Muller codes
Statement
Let be the squared Reed–Muller code matrix and . Consider an index that is the last row in a degree layer of , excluding the last layer; then is the first row in the next layer.
Layer-crossing conjecture.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.