5 problems

0 votes0 replies0 views
Full uplink degrees of freedom for large cell association budgets
Full-uplink-DoF conjecture. When $N_c \geq L+1$ , it is optimal to have full DoF in the uplink, and consequently the presented cell association and average puDoF are optimal in this…
Conjectureopencell-association degrees-of-freedom interference-managementarXiv posted 2 days ago
0 votes0 replies0 views
Extension of the atomic-subnetwork lemma to arbitrary sizes
Atomic-subnetwork extension conjecture. Lemma extends to atomic subnetworks of arbitrarily large sizes.
Conjectureopencooperative-communications degrees-of-freedom interference-managementarXiv posted 2 days ago
0 votes0 replies0 views
Algorithm 1 conjecture for characterizing the per-user DoF at cooperation order two
Algorithm 1 conjecture. Algorithm $1$ can be used to characterize
Conjectureopencooperative-communications degrees-of-freedom interference-managementarXiv posted 2 days ago
0 votes0 replies0 views
The outer-bound conjecture for the $(0,R_L,R_M)$ -setup when $L\leq M/2$
Outer-bound conjecture. For the $(0,R_L,R_M)$ -setup with $L\leq \frac{M}{2}$ , the inequality
Conjectureopeninformation-theory interference-management multicarrier-systemsarXiv posted 2 days ago
0 votes0 replies1 view
The wireless two-user vector broadcast channel sum-DoF conjecture
Sum-DoF conjecture. The sum DoF is $1$ .
Conjectureopenbroadcast-channels degrees-of-freedom interference-managementarXiv posted 2 days ago

Full uplink degrees of freedom for large cell association budgets