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 2012 · cs.ITShow all

8 papers · 2 filters

cs.IT2012

A Framework for Investigating the Performance of Chaotic-Map Truly Random Number Generators

Ahmad Beirami, Hamid Nejati

In this paper, we approximate the hidden Markov model of chaotic-map truly random number generators (TRNGs) and describe its fundamental limits based on the approximate entropy-rat…

cs.IT2012

Network Compression: Memory-Assisted Universal Coding of Sources with Correlated Parameters

Ahmad Beirami, Faramarz Fekri

In this paper, we propose {\em distributed network compression via memory}. We consider two spatially separated sources with correlated unknown source parameters. We wish to study…

cs.IT2012★ 5 cited

On Lossless Universal Compression of Distributed Identical Sources

Ahmad Beirami, Faramarz Fekri

Slepian-Wolf theorem is a well-known framework that targets almost lossless compression of (two) data streams with symbol-by-symbol correlation between the outputs of (two) distrib…

cs.IT2012★ 8 cited

Data Gathering in Networks of Bacteria Colonies: Collective Sensing and Relaying Using Molecular Communication

Arash Einolghozati, Mohsen Sardari, Ahmad Beirami +1

The prospect of new biological and industrial applications that require communication in micro-scale, encourages research on the design of bio-compatible communication networks usi…

cs.IT2012★ 4 cited

Results on the Fundamental Gain of Memory-Assisted Universal Source Coding

Ahmad Beirami, Mohsen Sardari, Faramarz Fekri

Many applications require data processing to be performed on individual pieces of data which are of finite sizes, e.g., files in cloud storage units and packets in data networks. H…

cs.IT2012

Memory-Assisted Universal Compression of Network Flows

Mohsen Sardari, Ahmad Beirami, Faramarz Fekri

Recently, the existence of considerable amount of redundancy in the Internet traffic has stimulated the deployment of several redundancy elimination techniques within the network.…

cs.IT2012★ 1 cited

A Performance Metric for Discrete-Time Chaos-Based Truly Random Number Generators

Ahmad Beirami, Hamid Nejati, Yehia Massoud

In this paper, we develop an information entropy based metric that represents the statistical quality of the generated binary sequence in Truly Random Number Generators (TRNG). The…

cs.IT2012★ 6 cited

Memory-Assisted Universal Source Coding

Ahmad Beirami, Faramarz Fekri

The problem of the universal compression of a sequence from a library of several small to moderate length sequences from similar context arises in many practical scenarios, such as…