activity
20132026
most citedAge of Information in Random Access Channels

8 citations · 36 across the 25 of their papers we have counts for

collaborators
Showing cs.ITShow all

14 papers · 1 filter

cs.IT2025

Optimal Neural Compressors for the Rate-Distortion-Perception Tradeoff

Eric Lei, Hamed Hassani, Shirin Saeedi Bidokhti

Recent efforts in neural compression have focused on the rate-distortion-perception (RDP) tradeoff, where the perception constraint ensures the source and reconstruction distributi…

cs.IT2024

Group Testing with General Correlation Using Hypergraphs

Hesam Nikpey, Saswati Sarkar, Shirin Saeedi Bidokhti

Group testing, a problem with diverse applications across multiple disciplines, traditionally assumes independence across nodes' states. Recent research, however, focuses on real-w…

cs.IT2024

Approaching Rate-Distortion Limits in Neural Compression with Lattice Transform Coding

Eric Lei, Hamed Hassani, Shirin Saeedi Bidokhti

Neural compression has brought tremendous progress in designing lossy compressors with good rate-distortion (RD) performance at low complexity. Thus far, neural compression design…

cs.IT2023

On a Relation Between the Rate-Distortion Function and Optimal Transport

Eric Lei, Hamed Hassani, Shirin Saeedi Bidokhti

We discuss a relationship between rate-distortion and optimal transport (OT) theory, even though they seem to be unrelated at first glance. In particular, we show that a function d…

cs.IT2022

Bounds on the Capacity of the Multiple Access Diamond Channel with Cooperating Base-Stations

Michael Dikshtein, Shirin Saeedi Bidokhti, Shlomo Shamai

A diamond network is considered in which the central processor is connected, via backhaul noiseless links, to multiple conferencing base stations, which communicate with a single u…

cs.IT2022

Group Testing with Correlation under Edge-Faulty Graphs

Hesam Nikpey, Jungyeol Kim, Xingran Chen +2

In applications of group testing in networks, e.g. identifying individuals who are infected by a disease spread over a network, exploiting correlation among network nodes provides…

cs.IT2021★ 1 cited

Timely Broadcasting in Erasure Networks: Age-Rate Tradeoffs

Xingran Chen, Renpu Liu, Shaochong Wang +1

The interplay between timeliness and rate efficiency is investigated in packet erasure broadcast channels with feedback. A scheduling framework is proposed in which coding actions,…

cs.IT2018

State-Adaptive Coded Caching for Symmetric Broadcast Channels

Shirin Saeedi Bidokhti, Michèle Wigger, Aylin Yener +1

Coded-caching delivery is considered over a symmetric noisy broadcast channel whose state is unknown at the transmitter during the cache placement phase. In particular, the deliver…

cs.IT2017

Benefits of Cache Assignment on Degraded Broadcast Channels

Shirin Saeedi Bidokhti, Michele Wigger, Aylin Yener

Degraded K-user broadcast channels (BC) are studied when receivers are facilitated with cache memories. Lower and upper bounds are derived on the capacity-memory tradeoff, i.e., on…

cs.IT2017★ 3 cited

Capacity Bounds on the Downlink of Symmetric, Multi-Relay, Single Receiver C-RAN Networks

Shirin Saeedi Bidokhti, Gerhard Kramer, Shlomo Shamai

The downlink of symmetric Cloud Radio Access Networks (C-RANs) with multiple relays and a single receiver is studied. Lower and upper bounds are derived on the capacity. The lower…

cs.IT2017★ 3 cited

Improved Converses and Gap Results for Coded Caching

Chien-Yi Wang, Shirin Saeedi Bidokhti, Michele Wigger

Improved lower bounds on the average and the worst-case rate-memory tradeoffs for the Maddah-Ali&Niesen coded caching scenario are presented. For any number of users and files and…

cs.IT2015

Capacity Regions of Two-User Broadcast Erasure Channels with Feedback and Hidden Memory

Michael Heindlmaier, Shirin Saeedi Bidokhti

The two-receiver broadcast packet erasure channel with feedback and memory is studied. Memory is modeled using a finite-state Markov chain representing a channel state. The channel…

cs.IT2014

On Capacity Regions of Two-Receiver Broadcast Packet Erasure Channels with Feedback and Memory

Michael Heindlmaier, Navid Reyhanian, Shirin Saeedi Bidokhti

The two-receiver broadcast packet erasure channel with feedback and memory is studied. Memory is modeled using a finite-state Markov chain representing a channel state. Outer and i…

cs.IT2013

Is Non-Unique Decoding Necessary?

Shirin Saeedi Bidokhti, Vinod M. Prabhakaran

In multi-terminal communication systems, signals carrying messages meant for different destinations are often observed together at any given destination receiver. Han and Kobayashi…