International audienceIn this paper, we analyze the performance of superposition coding for Gaussian broadcast channels with finite blocklength. To this end, we adapt two different achievability bounds, the dependence testing and the κβ bounds introduced by Polyanskiy et al. in 2010 to the broadcast setting. The distinction between these bounds lies in fixing either the input or the output distributions of the channel. For the first case of the dependence testing bound, an upper bound on the average error probability of the system is derived whereas for the latter, lower bounds on the maximal code sizes of each user are presented
In this paper, achievable rates regions are derived for power constrained Gaussian broadcast channel...
Abstract. An outer bound on the capacity region of broadcast channels is presented called the degrad...
This paper presents finite-blocklength achievabil- ity bounds for the Gaussian multiple access chann...
International audienceWe analyze the achievable performance of superposition coding in a two–receive...
This paper studies the performance of block coding on an additive white Gaussian noise channel under...
International audienceSuperposition coding (SC) has been known to be capacity achieving for the Gaus...
This paper considers the single antenna, static Gaussian broadcast channel in the finite blocklength...
A Broadcast Channel is a communication path between a single source and two or more receivers or use...
In this thesis, we aim to study broadcast channels with practical transmission constraints. First, w...
The last part considered a k-receiver broadcast channel with two unmatched degraded components, and ...
International audienceIn this paper, maximal achievable rate regions are derived for power constrain...
We derive the two-user capacity region with and without common information for a Gaussian broadcast ...
A method for power- and bandwidth efficient communication over the Gaussian channel is presented. Th...
We derive the capacity region for a broadcast channel with intersymbol interference (ISI) and colore...
We investigate novel inner and outer bounds on the rate region of a 2-user Gaussian broadcast channe...
In this paper, achievable rates regions are derived for power constrained Gaussian broadcast channel...
Abstract. An outer bound on the capacity region of broadcast channels is presented called the degrad...
This paper presents finite-blocklength achievabil- ity bounds for the Gaussian multiple access chann...
International audienceWe analyze the achievable performance of superposition coding in a two–receive...
This paper studies the performance of block coding on an additive white Gaussian noise channel under...
International audienceSuperposition coding (SC) has been known to be capacity achieving for the Gaus...
This paper considers the single antenna, static Gaussian broadcast channel in the finite blocklength...
A Broadcast Channel is a communication path between a single source and two or more receivers or use...
In this thesis, we aim to study broadcast channels with practical transmission constraints. First, w...
The last part considered a k-receiver broadcast channel with two unmatched degraded components, and ...
International audienceIn this paper, maximal achievable rate regions are derived for power constrain...
We derive the two-user capacity region with and without common information for a Gaussian broadcast ...
A method for power- and bandwidth efficient communication over the Gaussian channel is presented. Th...
We derive the capacity region for a broadcast channel with intersymbol interference (ISI) and colore...
We investigate novel inner and outer bounds on the rate region of a 2-user Gaussian broadcast channe...
In this paper, achievable rates regions are derived for power constrained Gaussian broadcast channel...
Abstract. An outer bound on the capacity region of broadcast channels is presented called the degrad...
This paper presents finite-blocklength achievabil- ity bounds for the Gaussian multiple access chann...