We consider the two scenarios of communicating a pair $S_{1},S_{2}$ of distributed correlated sources over 2–user multiple access (MAC) and interference channels (IC), respectively. While in the MAC problem, the receiver needs to reconstruct both sources, in the IC problem, receiver $j$ needs to reconstruct $S_{j}$ . We undertake a Shannon theoretic study and focus on characterizing sufficient conditions. Building on Dueck’s findings (1981), we propose a coding scheme based on fixed block-length (B-L) codes. We characterize its information theoretic performance and characterize a new set of sufficient conditions. We identify examples of the MAC and IC problems for which the latter conditions are proven to be strictly weaker than the current known tightest.

中文翻译：

---

通过 MAC 和干扰信道通信相关源 I：基于分离的方案

我们考虑通信对的两种情况 $S_{1},S_{2}$ 分别通过 2 用户多址 (MAC) 和干扰信道 (IC) 的分布式相关源。而在MAC问题，接收器需要重建两个源，在 集成电路问题， 接收者 $j$ 需要重建 $S_{j}$ . 我们进行香农理论研究并专注于表征充分条件。基于 Dueck 的发现 (1981)，我们提出了一种基于固定块长度 (BL) 码. 我们描述了它的信息论性能并描述了一组新的充分条件。我们确定了 MAC 和 IC 问题的例子，后者的条件被证明严格弱于当前已知的最严格的条件。