Effective construction of algebraic geometry codes

Authors:
G. Hache;D. Le Brigand
Affiliations:
Inst. Nat. de Recherche en Inf. et Autom., Le Chesnay;-
Venue:
IEEE Transactions on Information Theory - Part 1
Year:
2006

Citing 0
Cited 7

The Newton Polygon of Plane Curves with Many Rational Points

Designs, Codes and Cryptography
Computing a Basis of L(D) on an Affine Algebraic Curve with One Rational Place at Infinity

AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Symbolic Hamburger-Noether expressions of plane curves and applications to AG codes

Mathematics of Computation
Formal desingularization of surfaces: The Jung method revisited

Journal of Symbolic Computation
A generalization of Baker's theorem

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

Finite Fields and Their Applications
Computational aspects of retrieving a representation of an algebraic geometry code

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We intend to show that algebraic geometry codes may be constructed easily using blowing-up theory for any projective plane algebraic curve. Our paper is based on a paper by Le Brigand and Risler (1988). We try to be as explicit as possible