The problem of low complexity, close to optimal, channel decoding of linear codes with short
to moderate block length is considered. It is shown that deep learning methods can be used …

Consider a binary-input memoryless output-symmetric channel. Such a channel has a
capacity, call it, and for any and strictly positive constant we know that we can construct a …

A polar coding scheme is proposed for reliable communication over channels with bit-
interleaved coded modulation (BICM). In an ideal information-theoretic model, BICM …

Universal polar codes Page 1 1 Universal Polar Codes S. Hamed Hassani and Rüdiger
Urbanke Abstract—Polar codes, invented by Arikan in 2009, are known to achieve the capacity …

Challenges and some new directions in channel coding Page 1 328 JOURNAL OF
COMMUNICATIONS AND NETWORKS, VOL. 17, NO. 4, AUGUST 2015 Challenges and …

U-UV codes are constructed by a number of component codes in the (UUV) recursive
structure, where the U codes and V codes are component codes. This construction is known …

We analyze interleaved concatenation schemes of polar codes with outer binary BCH codes
and convolutional codes. We show that both BCH-polar and Conv-polar codes can have a …

Polar codes are the latest breakthrough in coding theory, as they are the first family of codes
with explicit construction that provably achieve the symmetric capacity of binary-input …

This paper presents a kind of concatenated polar codes called hash-polar codes with
flexible outer code lengths, in which a hash function-based encoder is used as an outer …

In this paper, a parallel concatenated structure is proposed to improve the performance of
polar codes in finite length in which multiblocks systematic polar codes (SPC) and recursive …