How to Compute Modulo Prime-Power Sums
arXiv:1609.04360 · doi:10.1109/ISIT.2016.7541614
Abstract
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.
References in corpus (7)
- The Approximate Capacity of the Many-to-One and One-to-Many Gaussian Interference Channels
- Computing sum of sources over an arbitrary multiple access channel
- A Layered Lattice Coding Scheme for a Class of Three User Gaussian Interference Channels
- A Joint Typicality Approach to Algebraic Network Information Theory
- Achievable rate region for three user discrete broadcast channel based on coset codes
- How to Compute Modulo Prime-Power Sums
- Trade-off between Communication and Cooperation in the Interference Channel