7 problems

Maximal diversity conjecture. For the general case with $L \leq \min(N_R,N_T)$ transmitting antennas, the maximal diversity is $(N_T-L+1)(N_R-L+1)$, coinciding with the lower bound…

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…

Consider a non-coherent multiple-input single-output (MISO) system using a non-unitary quasi-orthogonal space-time block code (QOSTBC) with an ABBA construction. For each pair of d…

A space-time block code (STC) used in a multiple-input single-output (MISO) system has a diversity order determined by the ranks of its distance matrices. An orthogonal space-time…

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…

EMI-$N$ full-diversity rate conjecture. When $N=2$, the bound is achieved: full diversity is still achieved at coding rate $R_c=0.75$. This conjecture concerns whether the upper bo…