Publication

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

Rüdiger Urbanke, Kirill Ivanov
2019
Conference Papers

Abstract

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, permutations of encoding factor graph as well as the properties of erasure channels.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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

Chat with Graph Search

On Speed and Advantage : Results in Information Velocity and Monitoring Problems

Reach For the Arcs: Reconstructing Surfaces from SDFs via Tangent Points

A Generalized Adjusted Min-Sum Decoder for 5G LDPC Codes: Algorithm and Implementation