Redundancies of correction capability optimized Reed-Muller codes
Discrete Applied Mathematics
Evaluation codes from order domain theory
Finite Fields and Their Applications
On puncturing of codes from Norm--Trace curves
Finite Fields and Their Applications
On the Structure of Order Domains
Finite Fields and Their Applications
Integral closures and weight functions over finite fields
Finite Fields and Their Applications
Weighted Reed---Muller codes revisited
Designs, Codes and Cryptography
Evaluation codes defined by finite families of plane valuations at infinity
Designs, Codes and Cryptography
| Hi-index | 754.84 |
The current algebraic-geometric (AG) codes are based on the theory of algebraic-geometric curves. In this paper we present a simple approach for the construction of AG codes, which does not require an extensive background in algebraic geometry. Given an affine plane irreducible curve and its set of all rational points, we can find a sequence of monomials xiyj based on the equation of the curve. Using the first r monomials as a basis for the dual code of a linear code, the designed minimum distance d of the linear code, called the AG code, can be easily determined. For these codes, we show a fast decoding procedure with a complexity O(n7/3), which can correct errors up to [(d-1/2]. For this approach it is neither necessary to know the genus of curve nor the basis of a differential form. This approach can be easily understood by most engineers