12 problems

Let $\Lambda$ be a complex signal set, and let $\Delta\Lambda$ denote its difference signal set. Consider an RS-PDSSDC whose variables $x_{1},x_{2},\ldots,x_{N}$ take values from…

DDF multi-antenna conjecture. DDF will not be able to sustain its optimality even in the low-multiplexing-gain regime when the terminals have multiple antennas.

Clustered-system DMT conjecture. The theorem stating that, for the clustered system, the DMT formula given for $m=1,2$ holds is true for arbitrary $(m,n,k)$.

Hexagonal-network cooperation conjecture. For this hexagonal model, a combination of transmitter and receiver cooperation should mitigate most of the interference and essentially e…

Let $k$ denote the diversity order associated with the probability that the coefficient matrix constructed during cooperative decoding is rank deficient. Subunit diversity-order co…

Let $M$ be the number of transmitters, and consider a compute-and-forward system whose linear equations are ordered from best to worst according to the successive minima of the res…

Atomic-subnetwork extension conjecture. Lemma extends to atomic subnetworks of arbitrarily large sizes.

Algorithm 1 conjecture. Algorithm $1$ can be used to characterize

Let $\rho$ denote the SNR, let $N$ be the final ARQ round, let $a$ and $\Delta$ be the channel-related quantity and threshold used in ARQ-SAF, and let $\bar{n}_r$ and $\phi_1$ be t…

Let a cooperative multiple access channel (CMA) consist of $N$ source nodes and a single destination node, and let SSAF denote the sequential slotted amplify-and-forward strategy.…

An interference network has multiple transmitting and receiving users, and its multiplexing gain is the pre-log of its total achievable rate at high signal-to-noise ratio. Cooperat…

The setting is a two-user Gaussian interference channel with transmitter cooperation, in which $u_1$ and $u_2$ denote cooperative private messages and dirty-paper coding can be use…