ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Consider the 2-transmitter 2-receiver network setting of the paper's linear-subspace-ratio lemma. Let n∈Nn\in\mathbb N, let {f1(n),f2(n)}\{f_1^{(n)},f_2^{(n)}\} be arbitrary encoding functions, let y⃗1n\vec{\bf y}_1^n and y⃗2n\vec{\bf y}_2^n be the corresponding received signals, and let Gn\bm{\mathcal{G}}^n denote the channel-state information. Generalized entropy-ratio conjecture. For every n∈Nn\in\mathbb N and every coding strategy,

h(y⃗1n∣Gn)≤32h(y⃗2n∣Gn)+n×o(log⁡(P)).h(\vec{\bf y}_1^n\mid\bm{\mathcal{G}}^n)\leq\frac{3}{2}h(\vec{\bf y}_2^n\mid\bm{\mathcal{G}}^n)+n\times o(\log(P)).

This conjecture extends the linear entropy or received-subspace dimension ratio to arbitrary encoding strategies and is proposed as the information-theoretic basis for the claimed total degrees-of-freedom value.

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.