ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let kk be the alphabet size of the channel input, and let lsl_s be the alphabet size of the code for User 2 in a permutation encoding approach. For an input-symmetric degraded broadcast channel, let GTYX,TZX\mathcal{G}_{T_{YX},T_{ZX}} denote the relevant family of matrices, and let {G1,…,Gls}\{G_1,\ldots,G_{l_s}\} be a smallest transitive subset of this family. Minimal transitive-subset conjecture. The code alphabet size satisfies ls=kl_s=k, and

∑j=1lsGj=11T.\sum_{j=1}^{l_s}G_j=\boldsymbol{1}\boldsymbol{1}^T.

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 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.