activity
20142024
most citedHow to Compute Modulo Prime-Power Sums

5 citations · 7 across the 4 of their papers we have counts for

collaborators

6 papers

cs.LG2024

CorBin-FL: A Differentially Private Federated Learning Mechanism using Common Randomness

Hojat Allah Salehi, Md Jueal Mia, S. Sandeep Pradhan +2

Federated learning (FL) has emerged as a promising framework for distributed machine learning. It enables collaborative learning among multiple clients, utilizing distributed data…

quant-ph2024★ 1 cited

Quantum Advantage in Non-Interactive Source Simulation

Hojat Allah Salehi, Farhad Shirani, S. Sandeep Pradhan

This work considers the non-interactive source simulation problem (NISS). In the standard NISS scenario, a pair of distributed agents, Alice and Bob, observe a distributed binary m…

cs.IT2017

On the Sub-optimality of Single-Letter Coding over Networks

Farhad Shirani, S. Sandeep Pradhan

In this paper, we establish a new bound tying together the effective length and the maximum correlation between the outputs of an arbitrary pair of Boolean functions which operate…

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…

cs.IT2014

An Achievable Rate-Distortion Region for the Multiple Descriptions Problem

Farhad Shirani, Sandeep Pradhan

A multiple-descriptions (MD) coding strategy is proposed and an inner bound to the achievable rate-distortion region is derived. The scheme utilizes linear codes. It is shown in tw…