2 problems

Consider the six sub-cases of Case I with fully-participated interactions treated in this paper, and let $t$-bit messages be used for any finite $t$. The paper gives achievable bro…

Let $\mathcal{D}^k$, $k \in \{13,14,\cdots,25\}$, be a side-information digraph whose sub-digraphs $\mathcal{D}_{i}^{k,\mathcal{P}}$, $i \in \{1,2,3\}$, have any type of interactio…