activity
20112026
most citedDitto: Fair and Robust Federated Learning Through Personalization

219 citations · 513 across the 53 of their papers we have counts for

collaborators
Showing 2011Show all

5 papers · 1 filter

cs.IT2011

Exact Modeling of the Performance of Random Linear Network Coding in Finite-buffer Networks

Nima Torabkhani, Badri N. Vellambi, Ahmad Beirami +1

In this paper, we present an exact model for the analysis of the performance of Random Linear Network Coding (RLNC) in wired erasure networks with finite buffers. In such networks,…

cs.IT2011

Results on the Redundancy of Universal Compression for Finite-Length Sequences

Ahmad Beirami, Faramarz Fekri

In this paper, we investigate the redundancy of universal coding schemes on smooth parametric sources in the finite-length regime. We derive an upper bound on the probability of th…

cs.IT2011★ 17 cited

On the Network-Wide Gain of Memory-Assisted Source Coding

Mohsen Sardari, Ahmad Beirami, Faramarz Fekri

Several studies have identified a significant amount of redundancy in the network traffic. For example, it is demonstrated that there is a great amount of redundancy within the con…

cs.IT2011★ 16 cited

Capacity of Discrete Molecular Diffusion Channels

Arash Einolghozati, Mohsen Sardari, Ahmad Beirami +1

In diffusion-based molecular communications, messages can be conveyed via the variation in the concentration of molecules in the medium. In this paper, we intend to analyze the ach…

cs.IT2011★ 3 cited

Consensus Problem under Diffusion-based Molecular Communication

Arash Einolghozati, Mohsen Sardari, Ahmad Beirami +1

We investigate the consensus problem in a network where nodes communicate via diffusion-based molecular communication (DbMC). In DbMC, messages are conveyed via the variation in th…