Publication

Recursive Projection-Aggregation Decoding of Reed-Muller Codes

Emmanuel Abbé
2020
Journal Articles

Abstract

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 codes), and aggregating the reconstructions (e.g., using majority votes). We further provide extensions of the algorithms using list-decoding. We run our algorithm for AWGN channels and Binary Symmetric Channels at the short code length (

Official source

https://infoscience.epfl.ch/entities/publication/9c456ed8-be89-475e-89a6-ada7e3c7c6cc

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

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.

Recursive Projection-Aggregation Decoding of Reed-Muller Codes

Chat with Graph Search

Deep Learning to Improve the Discovery of Near-earth Asteroids in the Zwicky Transient Facility

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

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