基于极化码软覆盖的经验和强协调
Empirical and Strong Coordination via Soft Covering with Polar Codes
摘要：
我们设计了两节点网络中经验协调和强协调的极化码。我们的构造取决于极化码使软覆盖的显式低复杂度方案成为可能的事实。我们利用这一属性，提出明确的和低复杂度的编码方案，实现能力区域的经验协调和强协调的行动序列采取价值的字母表中的素数基数。我们的研究结果改进了先前已知的极化编码方案，该方案（i）限于均匀分布和通过二进制对称信道获得的强协调动作，（ii）需要不可忽略的经验协调的共同随机量，以及（iii）假设离散无记忆信道的模拟可以完美地实现。作为我们的研究结果的副产品，我们得到了一个极性编码方案，实现了信道可分辨的任意离散无记忆信道，其输入字母具有素数基数。
英文摘要：
We design polar codes for empirical coordination and strong coordination in two-node networks. Our constructions hinge on the fact that polar codes enable explicit low-complexity schemes for soft covering. We leverage this property to propose explicit and low-complexity coding schemes that achieve the capacity regions of both empirical coordination and strong coordination for sequences of actions taking value in an alphabet of prime cardinality. Our results improve previously known polar coding schemes, which (i) were restricted to uniform distributions and to actions obtained via binary symmetric channels for strong coordination, (ii) required a non-negligible amount of common randomness for empirical coordination, and (iii) assumed that the simulation of discrete memoryless channels could be perfectly implemented. As a by-product of our results, we obtain a polar coding scheme that achieves channel resolvability for an arbitrary discrete memoryless channel whose input alphabet has prime cardinality.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
