AbstractIn this study, we design a superposition polar code that can achieve the capacity region of binary-input less-noisy broadcast channels asymptotically. Simulation results show that a better rate region is achievable by superposition polar coding than by time sharing between two point-to-point channel polar codes
Two polar coding schemes are proposed for the degraded broadcast channel under different reliabilit...
The inherent nature of polar codes being channel specific makes it difficult to use them in a settin...
The inherent nature of polar codes being channel specific makes it difficult to use them in a settin...
Polar codes are introduced for discrete memoryless broadcast channels. For m-user deterministic broa...
We present polar coding schemes for the 2-user discrete memoryless broadcast channel (DM-BC) which a...
Polar codes, introduced recently by Arikan, are the first family of codes known to achieve capacity ...
Existing polar coding schemes for the two-user interference channel follow the original idea of Han ...
We consider the bidirectional broadcast channel with common and confidential messages. We show that ...
Abstract In this paper, we design polar codes and polar lattices for i.i.d. fading channels when the...
The two central topics of information theory are the compression and the transmission of data. Shann...
A method is proposed, called channel polarization, to construct code sequences that achieve the symm...
In this paper, we design polar codes and polar lattices for independent identically distributed fadi...
This paper describes a successive cancellation decoder of polar codes for the two-user binary-input ...
Asymptotic secrecy-capacity achieving polar coding schemes are proposed for the memoryless degraded ...
Polar coding was conceived originally as a technique for boosting the cutoff rate of sequential deco...
Two polar coding schemes are proposed for the degraded broadcast channel under different reliabilit...
The inherent nature of polar codes being channel specific makes it difficult to use them in a settin...
The inherent nature of polar codes being channel specific makes it difficult to use them in a settin...
Polar codes are introduced for discrete memoryless broadcast channels. For m-user deterministic broa...
We present polar coding schemes for the 2-user discrete memoryless broadcast channel (DM-BC) which a...
Polar codes, introduced recently by Arikan, are the first family of codes known to achieve capacity ...
Existing polar coding schemes for the two-user interference channel follow the original idea of Han ...
We consider the bidirectional broadcast channel with common and confidential messages. We show that ...
Abstract In this paper, we design polar codes and polar lattices for i.i.d. fading channels when the...
The two central topics of information theory are the compression and the transmission of data. Shann...
A method is proposed, called channel polarization, to construct code sequences that achieve the symm...
In this paper, we design polar codes and polar lattices for independent identically distributed fadi...
This paper describes a successive cancellation decoder of polar codes for the two-user binary-input ...
Asymptotic secrecy-capacity achieving polar coding schemes are proposed for the memoryless degraded ...
Polar coding was conceived originally as a technique for boosting the cutoff rate of sequential deco...
Two polar coding schemes are proposed for the degraded broadcast channel under different reliabilit...
The inherent nature of polar codes being channel specific makes it difficult to use them in a settin...
The inherent nature of polar codes being channel specific makes it difficult to use them in a settin...