On the minimum distance of cyclic codes
IEEE Transactions on Information Theory
The Complete Determination of the Minimum Distance of Two-Point Codes on a Hermitian Curve
Designs, Codes and Cryptography
General secure multi-party computation from any linear secret-sharing scheme
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
On codes, matroids and secure multi-party computation from linear secret sharing schemes
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Algebraic geometric secret sharing schemes and secure multi-party computations over small fields
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
On the parameters of algebraic-geometry codes related to Arf semigroups
IEEE Transactions on Information Theory
Decoding algebraic-geometric codes up to the designed minimum distance
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
The order bound for general algebraic geometric codes
Finite Fields and Their Applications
| Hi-index | 0.00 |
We develop new coset bounds for algebraic geometric codes. The bounds have a natural interpretation as an adversary threshold for algebraic geometric secret sharing schemes and lead to improved bounds for the minimum distance of an AG code. Our bounds improve both floor bounds and order bounds and provide for the first time a connection between the two types of bounds.