Decoding Reed-Muller Codes Using Minimum-Weight Parity Checks

04/27/2018
by   Elia Santi, et al.
0

Reed-Muller (RM) codes exhibit good performance under maximum-likelihood (ML) decoding due to their highly-symmetric structure. In this paper, we explore the question of whether the code symmetry of RM codes can also be exploited to achieve near-ML performance in practice. The main idea is to apply iterative decoding to a highly-redundant parity-check (PC) matrix that contains only the minimum-weight dual codewords as rows. As examples, we consider the peeling decoder for the binary erasure channel, linear-programming and belief propagation (BP) decoding for the binary-input additive white Gaussian noise channel, and bit-flipping and BP decoding for the binary symmetric channel. For short block lengths, it is shown that near-ML performance can indeed be achieved in many cases. We also propose a method to tailor the PC matrix to the received observation by selecting only a small fraction of useful minimum-weight PCs before decoding begins. This allows one to both improve performance and significantly reduce complexity compared to using the full set of minimum-weight PCs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/21/2020

Pruning Neural Belief Propagation Decoders

We consider near maximum-likelihood (ML) decoding of short linear block ...
research
06/11/2019

Reinforcement Learning for Channel Coding: Learned Bit-Flipping Decoding

In this paper, we use reinforcement learning to find effective decoding ...
research
04/07/2020

Exact separation of forbidden-set cuts associated with redundant parity checks of binary linear codes

In recent years, several integer programming (IP) approaches were develo...
research
03/13/2018

A Branch-Price-and-Cut Algorithm for Optimal Decoding of LDPC Codes

Channel coding aims to minimize errors that occur during the transmissio...
research
04/27/2023

Generalized Automorphisms of Channel Codes: Properties, Code Design, and a Decoder

Low-density parity-check codes together with belief propagation (BP) dec...
research
09/09/2020

On Decoding of Reed-Muller Codes Using Local Graph Search

We present a novel iterative decoding algorithm for Reed-Muller (RM) cod...
research
05/08/2020

Sparsifying Parity-Check Matrices

Parity check matrices (PCMs) are used to define linear error correcting ...

Please sign up or login with your details

Forgot password? Click here to reset