Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: Bounding the trellis state complexity of algebraic geometric codes
Author: Munuera, C
Torres, F
Abstract: 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) greater than or equal to w(C) - R(2g - 2), where g is the genus of X. As a matter of fact, R(2g - 2) less than or equal to g - (gamma(2) - 2) with gamma(2) being the gonality of X over F-q, and thus in particular we have that s (C) greater than or equal to (C) g + gamma(2) - 2.
Subject: error correcting codes
algebraic geometric codes
trellis state complexity
gonality sequence of curves
Country: EUA
Editor: Springer
Citation: Applicable Algebra In Engineering Communication And Computing. Springer, v. 15, n. 2, n. 81, n. 100, 2004.
Rights: fechado
Identifier DOI: 10.1007/s00200-004-0150-z
Date Issue: 2004
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOS000224435700001.pdf203.06 kBAdobe PDFView/Open

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