**Date & Time:** Thursday, February 04, 2016, 17:30-18:30

**Venue:** Ramanujan Hall

**Title:** The order bound for algebraic geometry codes

**Speaker: ** Peter Beelen, Technical Univ. of Denmark

**Abstract:** The order bound is a general method to obtain a lower bound for
the minimum distance of an evaluation code. It is a very good bound in
case the code is defined using Goppa's construction of codes from curves.
In my talk I will outline the main ideas behind the order bound and make
them more explicit in the case of one-point algebraic-geometry codes