4 citations · 6 across the 5 of their papers we have counts for
6 papers
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…
Out-of-Distribution Robustness in Deep Learning Compression
Eric Lei, Hamed Hassani, Shirin Saeedi Bidokhti
In recent years, deep neural network (DNN) compression systems have proved to be highly effective for designing source codes for many natural sources. However, like many other mach…
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,…
Benefits of Coding on Age of Information in Broadcast Networks
Xingran Chen, Shirin Saeedi Bidokhti
Age of Information (AoI) is studied in two-user broadcast networks with feedback, and lower and upper bounds are derived on the expected weighted sum AoI of the users. In particula…
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…
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…