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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

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.
LaTeX, 13 pages, IEEE Trans. Inform. Theory: to appear, available at http://www.ime.unicamp.br/~ftorres

Keywords

Algebraic Geometry, Information Theory, 94B05, 94B27, 14G50

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/134348

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0212038
 http://arxiv.org/abs/math/0212038

Collections

arXiv