ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Consider a two-way 2×2×22\times2\times2 relay network with two multiple-antenna relays having N1N_1 and N2N_2 antennas, respectively, and four single-antenna transceivers. Let DoFC{\text{DoF}}_{C} denote the total degrees of freedom when the relays use caching.

General DoF upper-bound conjecture. The total degrees of freedom satisfies

DoFC≤4(N1+N2)N1+N2+1.{\text{DoF}}_{C}\le \frac{4(N_1+N_2)}{N_1+N_2+1}.

The preceding proposition establishes this bound when the relays transmit only the cached combined messages rather than the original individual messages. The conjecture asserts that the same expression is a general upper bound for the cached two-way relay network, including schemes using the original individual messages.

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.