English
Related papers

Related papers: Polar Coding for Multi-level 3-Receiver Broadcast …

200 papers

In this paper polar codes are proposed for two receiver broadcast channels with receiver message side information (BCSI) and noncausal state available at the encoder, referred to as BCSI with noncausal state for short, where the two…

Information Theory · Computer Science 2016-01-25 Jin Sima , Wei Chen

In this paper, we introduce a new coding and decoding structure for enhancing the reliability and performance of polar codes, specifically at low error rates. We achieve this by concatenating two polar codes in series to create robust…

Information Theory · Computer Science 2023-11-07 Mohammed Mensouri , Mustapha Eddahibi

It is shown that polar coding schemes achieve the known achievable rate regions for several multi-terminal communications problems including lossy distributed source coding, multiple access channels and multiple descriptions coding. The…

Information Theory · Computer Science 2014-04-29 Aria G. Sahebi , S. Sandeep Pradhan

Achieving security against adversaries with unlimited computational power is of great interest in a communication scenario. Since polar codes are capacity achieving codes with low encoding-decoding complexity and they can approach perfect…

Information Theory · Computer Science 2018-01-23 Amirsina Torfi , Sobhan Soleymani , Siamak Aram , Vahid Tabataba Vakili

Polar codes provably achieve the capacity of a wide array of channels under successive decoding. This assumes infinite precision arithmetic. Given the successive nature of the decoding algorithm, one might worry about the sensitivity of the…

Information Theory · Computer Science 2012-09-21 S. Hamed Hassani , Rudiger Urbanke

Recently, a new class of error-control codes, the polar codes, have attracted much attention. The polar codes are the first known class of capacity-achieving codes for many important communication channels. In addition, polar codes have…

Information Theory · Computer Science 2012-11-19 Xudong Ma

With the evolution from 5G to 6G, ultra-reliable low-latency communication (URLLC) faces increasingly stringent performance requirements. Lower latency constraints demand shorter channel coding lengths, which can severely degrade decoding…

Information Theory · Computer Science 2025-08-07 Yaqi Li , Xiaohu You , Jiamin Li , Chen Ji , Bin Sheng

Constructing efficient low-rate error-correcting codes with low-complexity encoding and decoding have become increasingly important for applications involving ultra-low-power devices such as Internet-of-Things (IoT) networks. To this end,…

Information Theory · Computer Science 2020-11-02 Fariba Abbasi , Hessam Mahdavifar , Emanuele Viterbo

Polar coding is a method for communication over noisy classical channels which is provably capacity-achieving and has an efficient encoding and decoding. Recently, this method has been generalized to the realm of quantum information…

Quantum Physics · Physics 2016-02-01 Christoph Hirche , Ciara Morgan , Mark M. Wilde

Polar codes are a family of capacity-achieving codes that have explicit and low-complexity construction, encoding, and decoding algorithms. Decoding of polar codes is based on the successive-cancellation decoder, which decodes in a bit-…

Information Theory · Computer Science 2018-03-06 Boaz Shuval , Ido Tal

Three-receiver broadcast channel (BC) is of interest due to its information theoretical differences with two receiver one. In this paper, we derive achievable rate regions for two classes of 3-receiver BC with side information available at…

Information Theory · Computer Science 2012-05-21 Saeed Hajizadeh , Ghosheh Abed Hodtani

Practical implementations of secret-key generation are often based on sequential strategies, which handle reliability and secrecy in two successive steps, called reconciliation and privacy amplification. In this paper, we propose an…

Information Theory · Computer Science 2015-08-07 Remi A. Chou , Matthieu R. Bloch , Emmanuel Abbe

This paper investigates the capacity regions of two-receiver broadcast channels where each receiver (i) has both common and private-message requests, and (ii) knows part of the private message requested by the other receiver as side…

Information Theory · Computer Science 2016-11-18 Behzad Asadi , Lawrence Ong , Sarah J. Johnson

We show that polar codes asymptotically achieve the whole capacity-equivocation region for the wiretap channel when the wiretapper's channel is degraded with respect to the main channel, and the weak secrecy notion is used. Our coding…

Information Theory · Computer Science 2010-09-27 Mattias Andersson , Vishwambhar Rathi , Ragnar Thobaben , Joerg Kliewer , Mikael Skoglund

We construct a channel coding scheme to achieve the capacity of any discrete memoryless channel based solely on the techniques of polar coding. In particular, we show how source polarization and randomness extraction via polarization can be…

Information Theory · Computer Science 2016-01-22 David Sutter , Joseph M. Renes , Frédéric Dupuis , Renato Renner

A probabilistic shaping method for multi-level coding (MLC) is presented, where the transmitted symbols are forced to have a shaped non-uniform distribution. It is shown that shaping only a single bit-level suffices to compensate for most…

Information Theory · Computer Science 2018-12-20 Onurcan İşcan , Ronald Böhnke , Wen Xu

This paper establishes inner bounds on the secrecy capacity regions for the general 3-receiver broadcast channel with one common and one confidential message sets. We consider two setups. The first is when the confidential message is to be…

Information Theory · Computer Science 2011-06-21 Yeow-Khiang Chia , Abbas El Gamal

Polar codes have been selected as the channel coding scheme for control channel in the fifth generation (5G) communication system thanks to their capacity achieving characteristics. However, the traditional polar codes support only codes…

Information Theory · Computer Science 2023-05-16 Hossein Rezaei , Nandana Rajatheva , Matti Latva-aho

A commonly assumed drawback of multi-level coding, compared to a bit-interleaved coded modulation, is its high latency: Indeed, the levels must be decoded sequentially. In this paper, we consider polar codes to code each level. We show that…

Information Theory · Computer Science 2022-06-02 Vincent Corlay

In this paper, we design polar codes and polar lattices for i.i.d. fading channels when the channel state information is only available to the receiver. For the binary input case, we propose a new design of polar codes through single-stage…

Information Theory · Computer Science 2016-02-08 Ling Liu , Cong Ling