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

Carlos Munuera, Fernando Torres

For a linear code $\cC$ of length $n$ and dimension $k$, Wolf noticed that the trellis state complexity $s(\cC)$ of $\cC$ is upper bounded by $w(\cC):=\min(k,n-k)$. In this paper w…