activity
20142026
most citedAn Achievable rate region for the user interference channel based on coset codes

30 citations · 31 across the 8 of their papers we have counts for

collaborators
Showing cs.ITShow all

6 papers · 1 filter

cs.IT2025

When Wyner and Ziv Met Bayes in Quantum-Classical Realm

Mohammad Aamir Sohail, Touheed Anwar Atif, S. Sandeep Pradhan

In this work, we address the lossy quantum-classical source coding with the quantum side-information (QC-QSI) problem. The task is to compress the classical information about a qua…

cs.IT2021

Computing Sum of Sources over a Classical-Quantum MAC

Touheed Anwar Atif, Arun Padakandla, S. Sandeep Pradhan

We consider the problem of communicating a general bivariate function of two classical sources observed at the encoders of a classical-quantum multiple access channel. Building on…

cs.IT2020

Source Coding for Synthesizing Correlated Randomness

Touheed Anwar Atif, Arun Padakandla, S. Sandeep Pradhan

We consider a scenario wherein two parties Alice and Bob are provided and -- samples that are IID from a PMF . Alice and Bob can communicate to…

cs.IT2015★ 1 cited

Coset codes for communicating over non-additive channels

Arun Padakandla, S. Sandeep Pradhan

We present a case for the use of codes possessing algebraic closure properties - coset codes - in developing coding techniques and characterizing achievable rate regions for generi…

cs.IT2014★ 30 cited

An Achievable rate region for the user interference channel based on coset codes

Arun Padakandla, Aria G. Sahebi, S. Sandeep Pradhan

We consider the problem of communication over a three user discrete memoryless interference channel (IC). The current known coding techniques for communicating over an arbitrar…

cs.IT2014

Polar Codes for Some Multi-terminal Communications Problems

Aria G. Sahebi, S. Sandeep Pradhan

It is shown that polar coding schemes achieve the known achievable rate regions for several multi-terminal communications problems including lossy distributed source coding, multip…