A Goppa-like bound on the trellis state complexity of algebraic geometric codes
| dc.creator | Munuera, Carlos | |
| dc.creator | Torres, Fernando | |
| dc.date | 2002-12-03 | |
| dc.date.accessioned | 2026-07-07T08:18:11Z | |
| dc.date.available | 2026-07-07T08:18:11Z | |
| dc.description | 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 we point out some new lower bounds for $s(\cC)$. In particular, if $\cC$ is an Algebraic Geometric code, then $s(\cC)\geq w(\cC)-(g-a)$, where $g$ is the genus of the underlying curve and $a$ is the abundance of the code. | |
| dc.description | LaTeX, 13 pages, IEEE Trans. Inform. Theory: to appear, available at http://www.ime.unicamp.br/~ftorres | |
| dc.identifier | https://arxiv.org/abs/math/0212038 | |
| dc.identifier | http://arxiv.org/abs/math/0212038 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/134348 | |
| dc.subject | Algebraic Geometry | |
| dc.subject | Information Theory | |
| dc.subject | 94B05, 94B27, 14G50 | |
| dc.title | A Goppa-like bound on the trellis state complexity of algebraic geometric codes | |
| dc.type | text |