Publication

LLR-based Successive Cancellation List Decoding of Polar Codes

Publications associées (30)

Fast 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

System and method for decoding reed-muller codes

Emmanuel Abbé, Min Ye

Various embodiments are directed to Reed-Muller decoding systems and methods based on recursive projections and aggregations of cosets decoding, exploiting the self-similarity of RM codes, and extended with list-decoding procedures and with outer-code conc ...

2020

On the Universality of Low-Density Parity-Check Block Codes

Rüdiger Urbanke, Wei Liu

An important class of modern channel codes is the capacity-achieving sequences of low-density parity-check block codes. Such sequences are usually designed for the binary erasure channel and are decoded by iterative message-passing algorithms. In this pape ...

IEEE2020

Compute-Forward for DMCs: Simultaneous Decoding of Multiple Combinations

Michael Christoph Gastpar, Adriano Pastore, Sung Hoon Lim, 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 INC2020

An Explicit Construction of Optimal Streaming Codes for Channels With Burst and Arbitrary Erasures

Damian Dudzicz

This paper presents a new construction of error correcting codes which achieves optimal recovery of a streaming source over a packet erasure channel. The channel model considered is the sliding-window erasure model, with burst and arbitrary losses, introdu ...

2020

Design and Decoding of Irregular LDPC Codes Based on Discrete Message Passing

Andreas Peter Burg

We consider discrete message passing (MP) decoding of low-density parity check (LDPC) codes based on information-optimal symmetric look-up table (LUT). A link between discrete message labels and the associated log-likelihood ratio values (defined in terms ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

From LDPC Block to LDPC Convolutional Codes: Capacity, Stability, and Universality

Wei Liu

In his landmark paper "A Mathematical Theory of Communication," the founding father of information theory and coding theory, Claude E. Shannon, established the largest rate at which reliable communication is possible and he revealed that the key to this re ...

EPFL2019

Permutation-based Decoding of Reed-Muller Codes in Binary Erasure Channel

Rüdiger Urbanke, Kirill Ivanov

In this paper, we consider the problem of decoding Reed-Muller (RM) codes in binary erasure channel. We propose a novel algorithm, which exploits several techniques, such as list recursive (successive cancellation) decoding based on Plotkin decomposition, ...

IEEE2019

Compute–Forward Multiple Access (CFMA): Practical Implementations

Michael Christoph Gastpar, Adriano Pastore, Jingge Zhu, Erixhen Sula, Sung Hoon Lim

We present a practical strategy that aims to attain rate points on the dominant face of the multiple access channel capacity using a standard low complexity decoder. This technique is built upon recent theoretical developments of Zhu and Gastpar on compute ...

2019

Reliable decoding of motor state transitions during imagined movement

Ricardo Andres Chavarriaga Lozano, José del Rocio Millán Ruiz, Bastien Orset

Current non-invasive Brain Machine interfaces commonly rely on the decoding of sustained motor imagery activity. This approach enables a user to control brain-actuated devices by triggering predetermined motor actions. However, despite of its broad range o ...

IEEE2019