5 citations · 7 across the 4 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.IT2016★ 5 cited
How to Compute Modulo Prime-Power Sums
Mohsen Heidari, S. Sandeep Pradhan
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 a…
cs.IT2016★ 1 cited
Trade-off between Communication and Cooperation in the Interference Channel
F. Shirani, S. S. Pradhan
We consider the problem of coding over the multi-user Interference Channel (IC). It is well-known that aligning the interfering signals results in improved achievable rates in cert…