Abstract
Let ** be an algebraic geometric code of dimension k and length n constructed on a curve ** over Fq. Let ** be the state complexity of ** and ** the Wolf upper bound on **. We introduce a numerical function R that depends on the gonality sequence of ** and show that ** where g is the genus of **. As a matter of fact, R(2g−2)≤g−(γ2−2) with γ2 being the gonality of ** over Fq, and thus in particular we have that **.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Applicable Algebra in Engineering, Communication and Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
