CV Lattes
ORCID
Google Scholar Citations
Universidade Federal de São Paulo (UNIFESP). Campus São José dos Campos. Instituto de Ciência e Tecnologia (ICT) (Institutional affiliation from the last research proposal) Birthplace: Brazil
I have a Bachelor's Degree in Mathematics with an Emphasis on Pure Mathematics and a Master's Degree in Mathematics both from São Paulo State University (UNESP). I have a Ph.D. in Mathematics from University of Campinas (UNICAMP). I am currently a professor at Institute of Science and Technology at Federal University of São Paulo (UNIFESP). My research focus on topics in Algebraic Number Theory, Lattices and Error Correcting Codes. In 2013 I received an honorable mention in the Capes Award for doctoral theses in the area of Mathematics/Probability and Statistics. I coordinated the Bachelor's in Computational Mathematics undergraduate course at the Federal University of São Paulo. I work in the Master's programs in Pure and Applied Mathematics at UNIFESP and Professional Master's Mathematics in the National Network (PROFMAT). (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) |
A lattice is a discrete additive subgroup of R^n. Signal constellations having lattice structure have been used as support for signal transmission over Gaussian and Rayleigh fading channels. Usually, the problem of finding good signal constellations for a Gaussian channel is associated to the search for latticeswith high packing density. On the other hand, for a Rayleigh fading channel …
A lattice is a discrete additive subgroup of R^n. It can be shown that given a lattice Lambda em R^n, there are m linearly independent vectors over R so that Lambda can be described as a linear combination of these m vectors with integer coefficients. A full rank lattice, that is, when m=n, is said to be well-rounded if the set consisting of its minimum Euclidean norm vectors generates R^…
The Error Correcting Codes Theory was founded in the 1940s, considering codes in the Hamming metric. The Lee metric was first used in error correcting codes in 1958. In 1970 it was conjectured that there are no perfect codes in the Lee metric in dimensions greater or equal to 3 and with packing radius greater ou equal to 2. Although some results have already been demonstrated towards to t…
| 2 / 2 | Completed research grants |
| 4 / 2 | Completed scholarships in Brazil |
| 6 / 4 | All research grants and scholarships |
| Associated processes | |