DeepAI AI Chat
Log In Sign Up

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

by   Isabella Panaccione, et al.

In this paper we present a decoding algorithm for algebraic geometry codes with error-correcting capacity beyond half the designed distance of the code. This algorithm comes as a fusion of the Power Error Locating Pairs algorithm for algebraic geometry codes and the technique used by Ehrhard in order to correct these codes up to half the designed distance. The decoding radius of this algorithm reaches that of Sudan algorithm, without any penalty given by the genus of the curve.


page 1

page 2

page 3

page 4


Power Error Locating Pairs

We present a new decoding algorithm based on error locating pairs and co...

Improved Power Decoding of Algebraic Geometry Codes

Power decoding is a partial decoding paradigm for arbitrary algebraic ge...

On Decoding and Applications of Interleaved Goppa Codes

Goppa Codes are a well-known class of codes with, among others, applicat...

A Dynamical System-based Key Equation for Decoding One-Point Algebraic-Geometry Codes

A closer look at linear recurring sequences allowed us to define the mul...

Peterson-Gorenstein-Zierler algorithm for differential convolutional codes

Differential Convolutional Codes with designed Hamming distance are defi...

Algebraic geometry codes and some applications

This article surveys the development of the theory of algebraic geometry...

Decoding Reed-Solomon codes by solving a bilinear system with a Gröbner basis approach

Decoding a Reed-Solomon code can be modeled by a bilinear system which c...