We investigate novel inner and outer bounds on the rate region of a 2-user Gaussian broadcast channel with finite, heterogeneous blocklength constraints (HB-GBC). In particular, we introduce a new, modified Sato-type outer bound that can be applied in the finite blocklength regime and which does not require the same marginal property. We then develop and analyze composite shell codes, which are suitable for the HB-GBC. Especially, to achieve a lower decoding latency for the user with a shorter blocklength constraint when successive interference cancellation is used, we derive the number of symbols needed to successfully early decode the other user's message. We numerically compare our derived outer bound to the best known achievable rate re...
This paper studies the performance of block coding on an additive white Gaussian noise channel under...
This paper studies the performance of block coding on an additive white Gaussian noise channel under...
In this paper, we propose a new upper bound on the error performance of binary linear codes over blo...
Abstract—In this paper, we study the Nair-El Gamal outer bound and Marton’s inner bound for general ...
We establish several new results on Marton’s inner bound on the capacity region of the general broad...
Motivated by the growing application of wireless multi-access networks with stringent delay constrai...
We derive the two-user capacity region with and without common information for a Gaussian broadcast ...
Abstract—In this paper, we study the achievable rate region of two-user Gaussian broadcast channel (...
Abstract — Motivated by the broadcast view of the interference channel, the new problem of communica...
In this paper, we study the achievable rate region of two-user Gaussian broadcast channel (GBC) when...
In this paper, we study the achievable rate region of two-user Gaussian broadcast channel (GBC) when...
In this paper, we study the achievable rate region of two-user Gaussian broadcast channel (GBC) when...
Abstract—Methods are developed that achieve all rate points inside the capacity region of two-receiv...
Abstract. An outer bound on the capacity region of broadcast channels is presented called the degrad...
This paper studies the performance of block coding on an additive white Gaussian noise channel under...
This paper studies the performance of block coding on an additive white Gaussian noise channel under...
This paper studies the performance of block coding on an additive white Gaussian noise channel under...
In this paper, we propose a new upper bound on the error performance of binary linear codes over blo...
Abstract—In this paper, we study the Nair-El Gamal outer bound and Marton’s inner bound for general ...
We establish several new results on Marton’s inner bound on the capacity region of the general broad...
Motivated by the growing application of wireless multi-access networks with stringent delay constrai...
We derive the two-user capacity region with and without common information for a Gaussian broadcast ...
Abstract—In this paper, we study the achievable rate region of two-user Gaussian broadcast channel (...
Abstract — Motivated by the broadcast view of the interference channel, the new problem of communica...
In this paper, we study the achievable rate region of two-user Gaussian broadcast channel (GBC) when...
In this paper, we study the achievable rate region of two-user Gaussian broadcast channel (GBC) when...
In this paper, we study the achievable rate region of two-user Gaussian broadcast channel (GBC) when...
Abstract—Methods are developed that achieve all rate points inside the capacity region of two-receiv...
Abstract. An outer bound on the capacity region of broadcast channels is presented called the degrad...
This paper studies the performance of block coding on an additive white Gaussian noise channel under...
This paper studies the performance of block coding on an additive white Gaussian noise channel under...
This paper studies the performance of block coding on an additive white Gaussian noise channel under...
In this paper, we propose a new upper bound on the error performance of binary linear codes over blo...