Bounding the trellis state complexity of algebraic geometric codes

Details Bounding the trellis state complexity of algebraic geometric codes Bounding the trellis state complexity of algebraic geometric codes

2003-03-08

arxiv.org/abs/math/0303104v1

Mathematics

Algebraic Geometry

LaTeX, 14 pages, available at http://www.ime.unicamp.br/~ftorres

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Bounding the trellis state complexity of algebraic geometric codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bounding the trellis state complexity of algebraic geometric codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounding the trellis state complexity of algebraic geometric codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-719885