Toward the Determination of the Minimum Distance of Two-Point Codes on a Hermitian Curve
Designs, Codes and Cryptography
The Two-Point Codes on a Hermitian Curve with the Designed Minimum Distance
Designs, Codes and Cryptography
The Two-Point Codes with the Designed Distance on a Hermitian Curve in Even Characteristic
Designs, Codes and Cryptography
Journal of Pure And Applied Algebra
The Complete Determination of the Minimum Distance of Two-Point Codes on a Hermitian Curve
Designs, Codes and Cryptography
The minimum distance of codes in an array coming from telescopic semigroups
IEEE Transactions on Information Theory - Part 1
Codes from the Suzuki function field
IEEE Transactions on Information Theory
Decoding algebraic-geometric codes up to the designed minimum distance
IEEE Transactions on Information Theory
A note on Hermitian codes over GF(q2)
IEEE Transactions on Information Theory - Part 1
The second generalized Hamming weight for two-point codes on a Hermitian curve
Designs, Codes and Cryptography
The Order Bound for Toric Codes
AAECC-18 '09 Proceedings of the 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
An Extension of the Order Bound for AG Codes
AAECC-18 '09 Proceedings of the 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Minimum distance decoding of general algebraic geometry codes via lists
IEEE Transactions on Information Theory
Coset bounds for algebraic geometric codes
Finite Fields and Their Applications
Bounding the number of points on a curve using a generalization of Weierstrass semigroups
Designs, Codes and Cryptography
| Hi-index | 0.06 |
The order bound gives an in general very good lower bound for the minimum distance of one-point algebraic geometric codes coming from curves. This paper is about a generalization of the order bound to several-point algebraic geometric codes coming from curves.