Publication
Polar Coding Theorems for Discrete Systems
Publications associées (178)
On Speed and Advantage : Results in Information Velocity and Monitoring Problems
Information theory has allowed us to determine the fundamental limit of various communication and algorithmic problems, e.g., the channel coding problem, the compression problem, and the hypothesis testing problem. In this work, we revisit the assumptions ...
EPFL2024Symmetry in design and decoding of polar-like codes
The beginning of 21st century provided us with many answers about how to reach the channel capacity. Polarization and spatial coupling are two techniques for achieving the capacity of binary memoryless symmetric channels under low-complexity decoding algor ...
EPFL2022A Unified Discretization Approach to Compute–Forward: From Discrete to Continuous Inputs
Michael Christoph Gastpar, Sung Hoon Lim, Adriano Pastore, Chen Feng
Compute–forward is a coding technique that enables receiver(s) in a network to directly decode one or more linear combinations of the transmitted codewords. Initial efforts focused on Gaussian channels and derived achievable rate regions via nested lattice ...
2022On the Efficiency of Polar-Like Decoding for Symmetric Codes
Rüdiger Urbanke, Kirill Ivanov
The recently introduced polar codes constitute a breakthrough in coding theory due to their capacity-achieving property. This goes hand in hand with a quasilinear construction, encoding, and successive cancellation list decoding procedures based on the Plo ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022Dynamic SCL Decoder With Path-Flipping for 5G Polar Codes
Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Yifei Shen, Chuan Zhang
Since polar were ratified as part of the 5G standard, low-complexity polar decoders with close-to-optimum error-rate performance have received significant attention. Compared to successive cancellation (SC) decoding, both SC list and SC flip decoding can i ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022A Revisitation of Low-Rate Bounds on the Reliability Function of Discrete Memoryless Channels for List Decoding
We revise the proof of low-rate upper bounds on the reliability function of discrete memoryless channels for ordinary and list-decoding schemes, in particular Berlekamp and Blinovsky's zero-rate bound, as well as Blahut's bound for low rates. The available ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022Polarization-Adjusted Convolutional (PAC) Codes: Sequential Decoding vs List Decoding
Andreas Peter Burg, Mohammad Rowshan
In the Shannon lecture at the 2019 International Symposium on Information Theory (ISIT), Arikan proposed to employ a one-to-one convolutional transform as a pre-coding step before the polar transform. The resulting codes of this concatenation are called po ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021Recursive Projection-Aggregation Decoding of Reed-Muller Codes
We propose a new class of efficient decoding algorithms for Reed-Muller (RM) codes over binary-input memoryless channels. The algorithms are based on projecting the code on its cosets, recursively decoding the projected codes (which are lower-order RM code ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020Compute-Forward for DMCs: Simultaneous Decoding of Multiple Combinations
Michael Christoph Gastpar, Sung Hoon Lim, Adriano Pastore, Chen Feng
Algebraic network information theory is an emerging facet of network information theory, studying the achievable rates of random code ensembles that have algebraic structure, such as random linear codes. A distinguishing feature is that linear combinations ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020Fast Block Sequential Decoding of Polar Codes
A reduced complexity sequential decoding algorithm for polar (sub) codes is described. The proposed approach relies on a decomposition of the polar (sub) code being decoded into a number of outer codes, and on-demand construction of codewords of these code ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020