如何计算模素幂和
How to Compute Modulo Prime-Power Sums
摘要：
研究了分布式信源编码中模素幂和的计算问题以及多址信道（MAC）中的模素幂和计算问题。我们建立在群码，并提出了一类新的代码称为准群码（QGC）。QGC是组码的子集。这些代码在组添加下未关闭。我们研究了QGC的一些性质，并给出了一个填充和覆盖界。接下来，我们使用这些界限来推导分布式信源编码的可实现速率以及MAC上的计算。我们表明，严格的改进，以前已知的计划，可以得到使用QGC的。
英文摘要：
The problem of computing modulo prime-power sums is investigated in distributed source coding as well as computation over Multiple-Access Channel (MAC). We build upon group codes and present a new class of codes called Quasi Group Codes (QGC). A QGC is a subset of a group code. These codes are not closed under the group addition. We investigate some properties of QGC's, and provide a packing and a covering bound. Next, we use these bounds to derived achievable rates for distributed source coding as well as computation over MAC. We show that strict improvements over the previously known schemes can be obtained using QGC's.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
