Bounding the trellis state complexity of algebraic geometric codes

Let C be an algebraic geometric code of dimension k and length n constructed on a curve X over $F_q$. Let s© be the state complexity of C and set w©:=min{k,n-k}, the Wolf upper bound on s©. We introduce a numerical function R that depends on the gonality sequence of X and show that s©\geq w©-R(2g-2), where g is the genus of X. As a matter of fact, R(2g-2)\leq g-(\gamma_2-2) with \gamma_2 being the gonality over F_q of X, and thus in particular we have that s©\geq w©-g+\gamma_2-2.