Decoding algebraic-geometric codes up to the designed minimum distance

Authors:
G. -L. Feng;T. R.N. Rao
Affiliations:
Center for Adv. Comput. Studies, Univ. of Southwestern Louisiana, Lafayette, LA;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 8

The order bound for general algebraic geometric codes

Finite Fields and Their Applications
Coset bounds for algebraic geometric codes

Finite Fields and Their Applications
Improved evaluation codes defined by plane valuations

Finite Fields and Their Applications
A Fast Decoding Method of AG Codes from Miura-Kamiya Curves Cab up to Half the Feng-Rao Bound

Finite Fields and Their Applications
Computing Weierstrass Semigroups and the Feng-Rao Distance from Singular Plane Models

Finite Fields and Their Applications
Decoding Algebraic Geometry Codes by a Key Equation

Finite Fields and Their Applications
Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes

Theoretical Computer Science
Evaluation codes defined by finite families of plane valuations at infinity

Designs, Codes and Cryptography

Quantified Score

Hi-index	754.84

Visualization

Abstract

A simple decoding procedure for algebraic-geometric codes C Ω(D,G) is presented. This decoding procedure is a generalization of Peterson's decoding procedure for the BCH codes. It can be used to correct any [(d*-1)/2] or fewer errors with complexity O(n3), where d * is the designed minimum distance of the algebraic-geometric code and n is the codelength