Abstract
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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 36-55 |
| Number of pages | 20 |
| Journal | Finite Fields and their Applications |
| Volume | 16 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jan 2010 |
Keywords
- Algebraic geometric code
- Floor bound
- Linear secret sharing
- Order bound
ASJC Scopus subject areas
- Theoretical Computer Science
- Algebra and Number Theory
- General Engineering
- Applied Mathematics