A New Permutation Decoding Method for Reed-Muller Codes

01/14/2019
by   Mikhail Kamenev, et al.
0

A novel permutation decoding method for Reed-Muller codes is presented. The complexity and the error correction performance of the suggested permutation decoding approach are similar to that of the recursive lists decoder. It is demonstrated that the proposed decoding technique can take advantage of several early termination methods leading to a significant reduction of the operations number required for the decoding, with the error correction performance being the same.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/16/2019

Permutation Decoding of Polar Codes

A new permutation decoding approach for polar codes is presented. The co...
research
02/06/2020

perm2vec: Graph Permutation Selection for Decoding of Error Correction Codes using Self-Attention

Error correction codes are integral part of communication applications, ...
research
03/25/2020

A CRC-aided Hybrid Decoding for Turbo Codes

Turbo codes and CRC codes are usually decoded separately according to th...
research
04/13/2019

Iterative Decoding of Trellis-Constrained Codes inspired by Amplitude Amplification (Preliminary Version)

We investigate a novel approach for the iterative decoding of Trellis-Co...
research
06/06/2023

A Novel Implementation Methodology for Error Correction Codes on a Neuromorphic Architecture

The Internet of Things infrastructure connects a massive number of edge ...
research
06/14/2023

Early-Stopped Technique for BCH Decoding Algorithm Under Tolerant Fault Probability

In this paper, a technique for the Berlekamp-Massey(BM) algorithm is pro...
research
01/30/2020

SCAN List Decoding of Polar Codes

In this paper we propose an enhanced soft cancellation (SCAN) decoder fo...

Please sign up or login with your details

Forgot password? Click here to reset