Bachelor in Mathematics (2007) and PhD (2012) at Universidad de Alicante (Spain). She is currently a visiting professor at the Center for Mathematics, Computing and Cognition at the Federal University of ABC in São Paulo (Brazil). Previously, she was a postdoctoral researcher at the University of Campinas. She has experience in Mathematics, with emphasis on coding theory, cryptography and discrete mathematics. (Source: Lattes Curriculum)
| News published in Agência FAPESP Newsletter about the researcher |
| More itemsLess items |
| TITULO |
| Articles published in other media outlets ( ): |
| More itemsLess items |
| VEICULO: TITULO (DATA) |
| VEICULO: TITULO (DATA) |
In this project, we present three lines of work. In the first, we explore the construction of superregular matrices, block superregular matrices, and triangular superregular matrices. These matrices play a crucial role in the construction of error-correcting codes with suitable properties for applications in communication theory. In the second line of work, we focus on the problem of coun…
inite fields are a branch of algebra with scientific applications, such as in information theory. Information Theory is a very active and popular field of Mathematics. Two of its main areas are cryptography and coding theory, which stand out both for their role as an interface between algebra, geometry, combinatorics, statistics, and computation, and for their numerous applications in com…
Cryptography is the science that studies the possible transformations of a message so that, when transmitted through an insecure channel, it can only be interpreted by the recipient. Cryptography, which has existed since there have been secrets, is no longer exclusively for use by rulers or the military. Today, cryptography is part of our daily lives. The use of computers and the birth of…
First, we work on a construction of MDS Fq-linear codes over Fqb based on the isomorphism between _fields Fq[C] and Fqb , where C is the companion matrix of a primitive polynomial of degree b in Fq[x]. If the parameters of one of our codes are [n; k; d], we can recover up to n-k erasures. We propose an algorithm to recover the lost information symbols just solving a linear system with tb …
| 1 / 1 | Ongoing grants |
| 2 / 2 | Ongoing scholarships in Brazil |
| 1 / 1 | Completed scholarships in Brazil |
| 4 / 4 | All research grants and scholarships |
| Associated processes | |
CV Lattes
ORCID