Coset bounds for algebraic geometric codes

Iwan M. Duursma, Seungkook Park

Research output: Contribution to journalArticlepeer-review


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 languageEnglish (US)
Pages (from-to)36-55
Number of pages20
JournalFinite Fields and their Applications
Issue number1
StatePublished - Jan 2010


  • 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


Dive into the research topics of 'Coset bounds for algebraic geometric codes'. Together they form a unique fingerprint.

Cite this