Publications by Shirin Saeedi Bidokhti

On multicasting nested message sets over combination networks

Suhas Diggavi, Shirin Saeedi Bidokhti, Vinod Malathidevi Prabhakaran

In this paper, we study delivery of two nested message sets over combination networks with an arbitrary number of receivers, where a subset of receivers (public receivers) demand only the lower priority message and a subset of receivers (private receivers) ...

Ieee2012

Is non-unique decoding necessary?

Suhas Diggavi, Shirin Saeedi Bidokhti, Vinod Malathidevi 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 (1981) proposed a receiving strategy which performs a joint unique decoding ...

Ieee2012

Broadcasting and Multicasting Nested Message Sets

Shirin Saeedi Bidokhti

Finding theoretical limits on the performance of communication systems and designing schemes to achieve them is one of the fundamental questions in information theory. While the theory of point-to-point communication is well-investigated, most problems hav ...

EPFL2012

Feedback-based coding algorithms for broadcast erasure channels with degraded message sets

Christina Fragouli, Shirin Saeedi Bidokhti

We consider single-hop broadcast packet erasure channels (BPEC) with degraded message sets and instantaneous feedback regularly available from all receivers, and demonstrate that the main principles of the virtual-queue-based algorithms in [1], which were ...

2012

Degraded two-message multicast over graphs

Christina Fragouli, Shirin Saeedi Bidokhti

We consider communication of two degraded mes- sage sets over graphs where a common source sends two prioritized messages (a common and a private message) to several receivers. All receivers require the common message and a subset of the receivers require ...

2011

On degraded two-message set broadcast

Suhas Diggavi, Christina Fragouli, Shirin Saeedi Bidokhti, Vinod Malathidevi Prabhakaran

We consider the two message set problem, where a source broadcasts a common message W1 to an arbitrary set of receivers U and a private message W2 to a subset of the receivers P ⊆U . Transmissions occur over linear deterministic channels. For the case wher ...

2009

Non-cooperative Multi-radio Channel Allocation in Wireless Networks

Jean-Pierre Hubaux, Mario Cagalj, Mark Felegyhazi, Shirin Saeedi Bidokhti

Channel allocation was extensively studied in the framework of cellular networks. But the emergence of new system concepts, such as cognitive radio systems, has brought this topic into the focus of research again. In this paper, we study in detail the prob ...

2007