Minimal transitive-subset conjecture for permutation encoding of input-symmetric degraded broadcast channels
Statement
Let be the alphabet size of the channel input, and let be the alphabet size of the code for User 2 in a permutation encoding approach. For an input-symmetric degraded broadcast channel, let denote the relevant family of matrices, and let be a smallest transitive subset of this family. Minimal transitive-subset conjecture. The code alphabet size satisfies , and
This conjecture concerns whether permutation encoding achieves the stated alphabet-size bound for User 2 on every input-symmetric degraded broadcast channel. The supplied text does not state whether the claim has been proved or disproved.
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.