This note is a written and extended version of the Shannon Lecture I gave at 2019
International Symposium on Information Theory. It gives an account of the original ideas that …

A method for efficiently constructing polar codes is presented and analyzed. Although polar
codes are explicitly defined, straightforward construction is intractable since the resulting …

Arikan's polar codes are capable of approaching Shannon's capacity at a low encoding and
decoding complexity, while conveniently supporting rate adaptation. By virtue of these …

Under successive cancellation (SC) decoding, polar codes are inferior to other codes of
similar blocklength in terms of frame error rate. While more sophisticated decoding …

As improved versions of the successive cancellation (SC) decoding algorithm, the
successive cancellation list (SCL) decoding and the successive cancellation stack (SCS) …

In this paper, we investigate an artificial-intelligence (AI) driven approach to design error
correction codes (ECC). Classic error-correction code design based upon coding-theoretic …

Spectral efficiency is always a key factor to be improved and optimized along mobile
communication networks evolving generation by generation. 5G enabling technologies must …

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 …

Polar codes have emerged as important channel codes because of their capacity-achieving
property. For low-complexity polar decoding, hardware architectures for successive …

This paper investigates properties of polar codes that can be potentially useful in real-world
applications. We start with analyzing the performance of finite-length polar codes over the …