Peterson-Gorenstein-Zierler algorithm for differential convolutional codes

10/25/2019
by   José Gómez-Torrecillas, et al.
0

Differential Convolutional Codes with designed Hamming distance are defined, and an algebraic decoding algorithm, inspired by Peterson-Gorenstein-Zierler's algorithm, is designed for them.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/18/2020

A decoding algorithm for 2D convolutional codes over the erasure channel

Two-dimensional (2D) convolutional codes are a generalization of (1D) co...
research
07/28/2022

Skew differential Goppa codes and their application to McEliece cryptosystem

A class of linear codes that extends classic Goppa codes to a non-commut...
research
03/13/2023

Finding the minimum distance and decoding linear codes with Gaussian Elimination Method

We propose an algorithm using the Gaussian elimination method to find th...
research
05/31/2020

Decoding Reed-Solomon Skew-Differential Codes

A large class of MDS linear codes is constructed. These codes are endowe...
research
03/20/2021

Attaining Sudan's decoding radius with no genus penalty for algebraic geometry codes

In this paper we present a decoding algorithm for algebraic geometry cod...
research
09/14/2021

Linear block and convolutional MDS codes to required rate, distance and type

Algebraic methods for the design of series of maximum distance separable...
research
04/10/2020

A Revisit to Ordered Statistic Decoding: Distance Distribution and Decoding Rules

This paper revisits the ordered statistic decoder (OSD) and provides a c...

Please sign up or login with your details

Forgot password? Click here to reset