A Goppa-like bound on the trellis state complexity of algebraic-geometric codes

For a linear code C of length n and dimension k, Wolf (1978) noticed that the trellis state complexity s(C) of C is upper-bounded by w(C):=min(k,n-k). We point out some new lower bounds for s(C). In particular, if C is an algebraic-geometric code, then s(C)/spl ges/w(C)-(g-a), where g is the genus of the underlying curve and a is the abundance of the code.