Algorithmic complexity in coding theory and the minimum distance problem
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A displacement approach to efficient decoding of algebraic-geometric codes
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A Systolic Array Implementation of the Feng-Rao Algorithm
IEEE Transactions on Computers
Symbolic Hamburger-Noether expressions of plane curves and applications to AG codes
Mathematics of Computation
Computer algebra handbook
A displacement approach to decoding algebraic codes
Contemporary mathematics
A geometric view of decoding AG codes
AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
On constructing AG codes without basis functions for riemann-roch spaces
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Computing Weierstrass Semigroups and the Feng-Rao Distance from Singular Plane Models
Finite Fields and Their Applications
On the Structure of Order Domains
Finite Fields and Their Applications
Decoding Algebraic Geometry Codes by a Key Equation
Finite Fields and Their Applications
On the unique representation of very strong algebraic geometry codes
Designs, Codes and Cryptography
Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension
Designs, Codes and Cryptography
Computational aspects of retrieving a representation of an algebraic geometry code
Journal of Symbolic Computation
| Hi-index | 0.00 |
This paper provides a survey of the existing literature on the decoding of algebraic-geometric codes. Definitions, theorems, and cross references will be given. We show what has been done, discuss what still has to be done, and pose some open problems