Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Author: Geil, O
Munuera, C
Ruano, D
Torres, F
Abstract: The order bound for the minimum distance of algebraic geometry codes was originally defined for the duals of one-point codes and later generalized for arbitrary algebraic geometry codes. Another bound of order type for the minimum distance of general linear codes, and for codes from order domains in particular, was given in [1]. Here we investigate in detail the application of that bound to one-point algebraic geometry codes, obtaining a bound d* for the minimum distance of these codes. We establish a connection between d* and the order bound and its generalizations. We also study the improved code constructions based on d*. Finally we extend d* to all generalized Hamming weights.
Subject: Linear codes
one-point algebraic geometry codes
minimum distance
Weierstrass semigroup
order bound
Country: EUA
Editor: Amer Inst Mathematical Sciences
Citation: Advances In Mathematics Of Communications. Amer Inst Mathematical Sciences, v. 5, n. 3, n. 489, n. 504, 2011.
Rights: aberto
Identifier DOI: 10.3934/amc.2011.5.489
Date Issue: 2011
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOS000293643300006.pdf378.62 kBAdobe PDFView/Open

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