The general DoF upper-bound conjecture for cached two-way 2×2×2 relay networks
Statement
Consider a two-way relay network with two multiple-antenna relays having and antennas, respectively, and four single-antenna transceivers. Let denote the total degrees of freedom when the relays use caching.
General DoF upper-bound conjecture. The total degrees of freedom satisfies
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.