Bounding the trellis state complexity of algebraic geometric codes
<|reference_start|>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(C) be the state complexity of C and set w(C):=min{k,n-k}, the Wolf upper bound on s(C). We introduce a numerical function R that depends on the gonality sequence of X and show that s(C)\geq w(C)-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(C)\geq w(C)-g+\gamma_2-2.<|reference_end|>
@article{munuera2003bounding,
    title={Bounding the trellis state complexity of algebraic geometric codes},
    author={Carlos Munuera and Fernando Torres},
    journal={arXiv preprint arXiv:math/0303104},
    year={2003},
    archivePrefix={arXiv},
    eprint={math/0303104},
    primaryClass={math.AG cs.IT math.IT}
}