Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: A goppa-like bound on the trellis state complexity of algebraic-geometric codes
Author: Munuera, C
Torres, F
Abstract: For 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.
Subject: algebraic-geometric codes
error-correcting codes
gonality sequence of curves
trellis state complexity
Country: EUA
Editor: Ieee-inst Electrical Electronics Engineers Inc
Rights: fechado
Identifier DOI: 10.1109/TIT.2002.808129
Date Issue: 2003
Appears in Collections:Artigos e Materiais de Revistas Científicas - Unicamp

Files in This Item:
File Description SizeFormat 
WOS000181449200016.pdf343.51 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.