Benefits of coding on age of information in broadcast networks
X Chen, SS Bidokhti - 2019 IEEE Information Theory Workshop …, 2019 - ieeexplore.ieee.org
Age of Information (AoI) is studied in two-user broad-cast networks with feedback, and lower
and upper bounds are derived on the expected weighted sum AoI of the users. In particular …
and upper bounds are derived on the expected weighted sum AoI of the users. In particular …
Capacity regions of two-receiver broadcast erasure channels with feedback and memory
M Heindlmaier, SS Bidokhti - IEEE Transactions on Information …, 2018 - ieeexplore.ieee.org
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. Two …
Memory is modeled using a finite-state Markov chain representing a channel state. Two …
On capacity regions of two-receiver broadcast packet erasure channels with feedback and memory
M Heindlmaier, N Reyhanian… - 2014 52nd Annual …, 2014 - ieeexplore.ieee.org
The two-receiver broadcast packet erasure channel with feedback and memory is studied.
Memory is modelled using a finite-state Markov chain representing a channel state. Outer …
Memory is modelled using a finite-state Markov chain representing a channel state. Outer …
Capacity region of two symmetric nearby erasure channels with channel state feedback
CC Wang - 2012 IEEE Information Theory Workshop, 2012 - ieeexplore.ieee.org
This work considers a commonly encountered wireless transmission scenario: Two nearby 1-
hop flows s 1→ d 1 and s 2→ d 2 are within the transmission range of each other. The …
hop flows s 1→ d 1 and s 2→ d 2 are within the transmission range of each other. The …
Linear network coding capacity for broadcast erasure channels with feedback, receiver coordination, and arbitrary security requirement
CC Wang - 2013 IEEE International Symposium on Information …, 2013 - ieeexplore.ieee.org
This work considers a commonly encountered wireless transmission scenario. The base
station s would like to send two independent packet streams to clients d 1 and d 2 …
station s would like to send two independent packet streams to clients d 1 and d 2 …
Capacity regions of two-user broadcast erasure channels with feedback and hidden memory
M Heindlmaier, SS Bidokhti - 2015 IEEE International …, 2015 - ieeexplore.ieee.org
The two-receiver broadcast packet erasure channel with feedback and memory is studied.
Memory is modelled using a finite-state Markov chain representing a channel state. The …
Memory is modelled using a finite-state Markov chain representing a channel state. The …
Broadcast erasure channel with feedback: The two multicast case—Algorithms and bounds
E Onaran, M Gatzianas… - … Symposium on Network …, 2013 - ieeexplore.ieee.org
We consider the single hop broadcast packet erasure channel (BPEC) with two multicast
sessions (each of them destined to a different group of N users) and regularly available …
sessions (each of them destined to a different group of N users) and regularly available …
Coding schemes for broadcast erasure channels with feedback: the two multicast case
We consider the single hop broadcast packet erasure channel (BPEC) with two multicast
sessions (each of them destined to a different group of $ N $ users) and regularly available …
sessions (each of them destined to a different group of $ N $ users) and regularly available …