From sequential decoding to channel polarization and back again

Abstract

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 motivated the development of polar coding and discusses some new ideas for exploiting channel polarization more effectively in order to improve the performance of polar codes.

10 pages, 14 figures. To appear in IEEE Information Theory Society Newsletter. Expanded version of a lecture presented at the IEEE 2019 International Symposium on Information Theory, 10 July 2019, Paris

Cited by in corpus (13)

• PAC Codes: Sequential Decoding vs List Decoding
• CRC-Aided List Decoding of Convolutional Codes in the Short Blocklength Regime
• A Golden Decade of Polar Codes: From Basic Principle to 5G Applications
• Approximate Weight Distribution of Polarization-Adjusted Convolutional (PAC) Codes
• Enumeration of Minimum Weight Codewords of Pre-Transformed Polar Codes by Tree Intersection
• Frozen Set Design for Precoded Polar Codes
• Successive Cancellation Decoding with Future Constraints for Polar Codes Over the Binary Erasure Channel
• Selectively Precoded Polar Codes
• A Deterministic Algorithm for Computing the Weight Distribution of Polar Codes
• Dynamic Frozen-Function Design for Reed-Muller Codes With Automorphism-Based Decoding
• A Soft Cancellation Decoder for Parity-Check Polar Codes
• Anytime Decoding by Monte-Carlo Tree Search
• Complexity-Adaptive Maximum-Likelihood Decoding of Modified ${\mathbf{G}}_N$-Coset Codes