42 research outputs found
On some invariants in numerical semigroups and estimations of the order bound
We study suitable parameters and relations in a numerical semigroup S. When S
is the Weierstrass semigroup at a rational point P of a projective curve C, we
evaluate the Feng-Rao order bound of the associated family of Goppa codes.
Further we conjecture that the order bound is always greater than a fixed value
easily deduced from the parameters of the semigroup: we also prove this
inequality in several cases
On the second Feng-Rao distance of Algebraic Geometry codes related to Arf semigroups
Producción CientíficaWe describe the second (generalized) Feng-Rao distance for elements in an Arf numerical semigroup that are greater than or equal to the conductor of the semigroup. This provides a lower bound for the second Hamming weight for one point AG codes. In particular, we can obtain the second Feng-Rao distance for the codes defined by asymptotically good towers of function fields whose Weierstrass semigroups are inductive. In addition, we compute the second Feng-Rao number, and provide some examples and comparisons with previous results on this topic. These calculations rely on Apéry sets, and thus several results concerning Apéry sets of Arf semigroups are presented.Ministerio de Economía, Industria y Competitividad; y Fondo Europeo de Desarrollo Regional FEDER( Projects MTM2014-55367-P / MTM2015-65764-C3-1-P)Junta de Andalucía (Grant FQM-343)Fundação para a Ciência e a Tecnologia (Project UID/MAT/00297/2013
Computation of numerical semigroups by means of seeds
For the elements of a numerical semigroup which are larger than the Frobenius
number, we introduce the definition of, seed, by broadening the notion of
generator. This new concept allows us to explore the semigroup tree in an
alternative efficient way, since the seeds of each descendant can be easily
obtained from the seeds of its parent. The paper is devoted to presenting the
results which are related to this approach, leading to a new algorithm for
computing and counting the semigroups of a given genus
Collected results on semigroups, graphs and codes
In this thesis we present a compendium of _ve works where discrete mathematics play a key role. The _rst three works describe di_erent developments and applications of the semigroup theory while the other two have more independent topics. First we present a result on semigroups and code e_ciency, where we introduce our results on the so-called Geil-Matsumoto bound and Lewittes' bound for algebraic geometry codes. Following that, we work on semigroup ideals and their relation with the Feng-Rao numbers; those numbers, in turn, are used to describe the Hamming weights which are used in a broad spectrum of applications, i.e. the wire-tap channel of type II or in the t-resilient functions used in cryptography. The third work presented describes the non-homogeneous patterns for semigroups, explains three di_erent scenarios where these patterns arise and gives some results on their admissibility. The last two works are not as related as the _rst three but still use discrete mathematics. One of them is a work on the applications of coding theory to _ngerprinting, where we give results on the traitor tracing problem and we bound the number of colluders in a colluder set trying to hack a _ngerprinting mark made with a Reed-Solomon code. And _nally in the last work we present our results on scientometrics and graphs, modeling the scienti_c community as a cocitation graph, where nodes represent authors and two nodes are connected if there is a paper citing both authors simultaneously. We use it to present three new indices to evaluate an author's impact in the community