DeepAI AI Chat
Log In Sign Up

Improved Power Decoding of Algebraic Geometry Codes

by   Sven Puchinger, et al.

Power decoding is a partial decoding paradigm for arbitrary algebraic geometry codes for decoding beyond half the minimum distance, which usually returns the unique closest codeword, but in rare cases fails to return anything. The original version decodes roughly up to the Sudan radius, while an improved version decodes up to the Johnson radius, but has so far been described only for Reed–Solomon and one-point Hermitian codes. In this paper we show how the improved version can be applied to any algebraic geometry code.


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...

Algebraic geometry codes and some applications

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

Power Error Locating Pairs

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

Improved Power Decoding of Interleaved One-Point Hermitian Codes

We propose a new partial decoding algorithm for h-interleaved one-point ...

Algorithmizing the Multiplicity Schwartz-Zippel Lemma

The multiplicity Schwartz-Zippel lemma asserts that over a field, a low-...

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...

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...