DoF Analysis for (M, N)-Channels through a Number-Filling Puzzle

Yue Bi, Yue Wu, Cunqing Hua

We consider a $\mathsf{K}$ user interference network with general connectivity, described by a matrix $\mat{N}$, and general message flows, described by a matrix $\mat{M}$. Previous stu…