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

dc.creatorMunuera, C
dc.creatorTorres, F
dc.date2003
dc.dateMAR
dc.date2014-11-14T17:54:30Z
dc.date2015-11-26T17:16:13Z
dc.date2014-11-14T17:54:30Z
dc.date2015-11-26T17:16:13Z
dc.date.accessioned2018-03-29T00:04:24Z
dc.date.available2018-03-29T00:04:24Z
dc.identifierIeee Transactions On Information Theory. Ieee-inst Electrical Electronics Engineers Inc, v. 49, n. 3, n. 733, n. 737, 2003.
dc.identifier0018-9448
dc.identifierWOS:000181449200016
dc.identifier10.1109/TIT.2002.808129
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/75874
dc.identifierhttp://www.repositorio.unicamp.br/handle/REPOSIP/75874
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/75874
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1282230
dc.descriptionFor a linear code C of length n and dimension k, Wolf noticed that the trellis state complexity s(C) of C is upper-bounded by := w(C) min(k, n - k). In this correspondence, we point out some new lower hounds for s(C). In particular, if C is an algebraic-geometric code, then s (C) greater than or equal to w (C) - (g - a), where g is the genus of the underlying curve and a is the abundance of the code.
dc.description49
dc.description3
dc.description733
dc.description737
dc.languageen
dc.publisherIeee-inst Electrical Electronics Engineers Inc
dc.publisherNew York
dc.publisherEUA
dc.relationIeee Transactions On Information Theory
dc.relationIEEE Trans. Inf. Theory
dc.rightsfechado
dc.rightshttp://www.ieee.org/publications_standards/publications/rights/rights_policies.html
dc.sourceWeb of Science
dc.subjectalgebraic-geometric codes
dc.subjecterror-correcting codes
dc.subjectgonality sequence of curves
dc.subjecttrellis state complexity
dc.subjectLinear Block-codes
dc.subjectWeights
dc.subjectBch
dc.titleA goppa-like bound on the trellis state complexity of algebraic-geometric codes
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución