English
Related papers

Related papers: Strong Coordination with Polar Codes

200 papers

The inherent nature of polar codes being channel specific makes it difficult to use them in a setting where the communication channel changes with time. In particular, to be able to use polar codes in a wireless scenario, varying…

Information Theory · Computer Science 2017-04-04 P. K. Deekshith , K. R. Sahasranand

Link and node failures are common two fundamental problems that affect operational networks. Hence, protection of communication networks is essential to increase their reliability, performance, and operations. Much research work has been…

Information Theory · Computer Science 2009-06-30 Salah A. Aly , Ahmed E. Kamal

In this paper, we propose a novel partial order for binary discrete memoryless channels that we call the symmetric convex ordering. We show that Ar{\i}kan's polar transform preserves 'symmetric convex orders'. Furthermore, we show that…

Information Theory · Computer Science 2018-06-29 Mine Alsan

This paper investigates universal polar coding schemes. In particular, a notion of ordering (called convolutional path) is introduced between probability distributions to determine when a polar compression (or communication) scheme designed…

Information Theory · Computer Science 2010-12-03 Emmanuel Abbe

In this paper, we propose a new class of lattices constructed from polar codes, namely polar lattices, to achieve the capacity $\frac{1}{2}\log(1+\SNR)$ of the additive white Gaussian-noise (AWGN) channel. Our construction follows the…

Information Theory · Computer Science 2018-10-16 Ling Liu , Yanfei Yan , Cong Ling , Xiaofu Wu

Polar codes are a class of {\bf structured} channel codes proposed by Ar{\i}kan based on the principle of {\bf channel polarization}, and can {\bf achieve} the symmetric capacity of any Binary-input Discrete Memoryless Channel (B-DMC). The…

Information Theory · Computer Science 2019-11-22 Yong Fang

We study the application of polar codes in deletion channels by analyzing the cascade of a binary erasure channel (BEC) and a deletion channel. We show how polar codes can be used effectively on a BEC with a single deletion, and propose a…

Information Theory · Computer Science 2017-01-10 Eldho K. Thomas , Vincent Y. F. Tan , Alexander Vardy , Mehul Motani

Multi-kernel polar codes have recently been proposed to construct polar codes of lengths different from powers of two. Decoder implementations for multi-kernel polar codes need to account for this feature, that becomes critical in memory…

Information Theory · Computer Science 2018-09-26 Valerio Bioglio , Carlo Condo , Ingmar Land

In this paper, we propose a comprehensive Polar coding solution that integrates reliability calculation, rate matching and parity-check coding. Judging a channel coding design from the industry's viewpoint, there are two primary concerns:…

Information Theory · Computer Science 2018-01-12 Huazi Zhang , Rong Li , Jian Wang , Shengchen Dai , Gongzheng Zhang , Ying Chen , Hejia Luo , Jun Wang

Ar{\i}kan's polar coding technique is based on the idea of synthesizing $n$ channels from the $n$ instances of the physical channel by a simple linear encoding transformation. Each synthesized channel corresponds to a particular input to…

Information Theory · Computer Science 2016-01-22 Joseph M. Renes , David Sutter , S. Hamed Hassani

Polar codes have emerged as the most favorable channel codes for their unique capacity-achieving property. To date, numerous works have been reported for efficient design of polar codes decoder. However, these prior efforts focused on…

Information Theory · Computer Science 2015-01-15 Bo Yuan , Keshab K. Parhi

A method for construction of polar subcodes is presented, which aims on minimization of the number of low-weight codewords in the obtained codes, as well as on improved performance under list or sequential decoding. Simulation results are…

Information Theory · Computer Science 2017-05-04 Peter Trifonov , Grigorii Trofimiuk

Targeting high-throughput and low-power communications, we implement two successive cancellation (SC) decoders for polar codes. With $16nm$ ASIC technology, the area efficiency and energy efficiency are $4Tbps/mm^2$ and $0.63pJ/bit$,…

Information Theory · Computer Science 2021-07-20 Jiajie Tong , Xianbin Wang , Qifan Zhang , Huazi Zhang , Rong Li , Jun Wang , Wen Tong

Polar codes have attracted the attention of academia and industry alike in the past decade, such that the 5$^\text{th}$ generation wireless systems (5G) standardization process of the 3$^\text{th}$ generation partnership project (3GPP)…

Information Theory · Computer Science 2020-01-07 Valerio Bioglio , Carlo Condo , Ingmar Land

With the increasing demand for ultra-reliable and low-latency communication (URLLC), spatiotemporal two-dimensional (2-D) channel coding has received growing interest. By leveraging the spatial degrees of freedom in massive multiple-input…

Information Theory · Computer Science 2026-04-24 Yaqi Li , Shuohan Zhang , Xiaohu You , Jiamin Li

In this paper, we propose a new polar coding scheme with molecular programming, which is capable of highly parallel implementation at a nano-scale without a need of electrical power sources. We designed chemical reaction networks (CRN) to…

Information Theory · Computer Science 2019-03-12 Toshiki Matsumine , Toshiaki Koike-Akino , Ye Wang

Polar codes were introduced in 2009 and proven to achieve the symmetric capacity of any binary-input discrete memoryless channel under low-complexity successive cancellation decoding. In this thesis, we construct cyclic polar codes based on…

Information Theory · Computer Science 2020-04-16 Narayanan Rengaswamy

Multilevel coding (MLC) is a coded modulation technique which can achieve excellent performance over a range of communication channels. Polar codes have been shown to be quite compatible with communication systems using MLC, as the rate…

Information Theory · Computer Science 2021-04-21 Muhammad Zaeem Hasan , Nemanja Stefan Perović , Mark F. Flanagan

We revisit the idea of using deep neural networks for one-shot decoding of random and structured codes, such as polar codes. Although it is possible to achieve maximum a posteriori (MAP) bit error rate (BER) performance for both code…

Information Theory · Computer Science 2017-01-27 Tobias Gruber , Sebastian Cammerer , Jakob Hoydis , Stephan ten Brink

This paper proposes an efficient secret key cryptosystem based on polar codes over Binary Erasure Channel. We introduce a method, for the first time to our knowledge, to hide the generator matrix of the polar codes from an attacker. In…

Cryptography and Security · Computer Science 2013-08-02 Reza Hooshmand , Masoumeh Koochak Shooshtari , Mohammad Reza Aref