GJGrasiele C. Jorge
Grasiele C. Jorge
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Grasiele C. Jorge has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Antonio Campello
Institute of Mathematics, Statistics and Computer Science University of Campinas 13083-859 São Paulo Brazil
3 shared publications - João Eloir Strapasson
Faculty of Applied Sciences, University of Campinas, Limeira, Brazil
3 shared publications - Sueli Irene Rodrigues Costa
Institute of Mathematics, Statistics and Scientific Computing (IMECC), University of Campinas (Unicamp), Campinas, So Paulo, Brazil
3 shared publications L. F. Santos
1 shared publication
Latest Publications
- Open Access
Constructions of lattices via biquadratic and triquadratic fields
The lattices $D_4$ and $E_8$ are known to be the densest lattices in dimensions 4 and 8, respectively. In this paper, we employ tools from algebraic number theory to prove that the $D_4$-lattice arises from an infinite family of totally imaginary biquadratic fields. Furthermore, we extend this construction to show that both the $D_8$ and $E_8$ can be realized via triquadratic fields derived from this family.Open AccessConstructions of lattices via biquadratic and triquadratic fields
The lattices $D_4$ and $E_8$ are known to be the densest lattices in dimensions 4 and 8, respectively. In this paper, we employ tools from algebraic number theory to prove that the $D_4$-lattice arises from an infinite family of totally imaginary biquadratic fields. Furthermore, we extend this construction to show that both the $D_8$ and $E_8$ can be realized via triquadratic fields derived from this family. - 8 August 2016
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 37 (2) , 852-866
Quasi-perfect codes in the $\ell _p$ ℓ p metric- 8 August 2016
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 37 (2) , 852-866
Quasi-perfect codes in the $\ell _p$ ℓ p metric- Open Access
Perfect codes in the lp metric
We investigate perfect codes in $\mathbb{Z}^n$ under the $\ell_p$ metric. Upper bounds for the packing radius $r$ of a linear perfect code, in terms of the metric parameter $p$ and the dimension $n$ are derived. For $p = 2$ and $n = 2, 3$, we determine all radii for which there are linear perfect codes. The non-existence results for codes in $\mathbb{Z}^n$ presented here imply non-existence results for codes over finite alphabets $\mathbb{Z}_q$, when the alphabet size is large enough, and has implications on some recent constructions of spherical codes.Open AccessPerfect codes in the lp metric
We investigate perfect codes in $\mathbb{Z}^n$ under the $\ell_p$ metric. Upper bounds for the packing radius $r$ of a linear perfect code, in terms of the metric parameter $p$ and the dimension $n$ are derived. For $p = 2$ and $n = 2, 3$, we determine all radii for which there are linear perfect codes. The non-existence results for codes in $\mathbb{Z}^n$ presented here imply non-existence results for codes over finite alphabets $\mathbb{Z}_q$, when the alphabet size is large enough, and has implications on some recent constructions of spherical codes. - Open AccessQuasi-perfect codes in the $\ell_p$ metricWe consider quasi-perfect codes in $\mathbb{Z}^n$ over the $\ell_p$ metric, $2 \leq p < \infty$. Through a computational approach, we determine all radii for which there are linear quasi-perfect codes for $p = 2$ and $n = 2, 3$. Moreover, we study codes with a certain \textit{degree of imperfection}, a notion that generalizes the quasi-perfect codes. Numerical results concerning the codes with the smallest degree of imperfection are presented.Open AccessQuasi-perfect codes in the $\ell_p$ metricWe consider quasi-perfect codes in $\mathbb{Z}^n$ over the $\ell_p$ metric, $2 \leq p < \infty$. Through a computational approach, we determine all radii for which there are linear quasi-perfect codes for $p = 2$ and $n = 2, 3$. Moreover, we study codes with a certain \textit{degree of imperfection}, a notion that generalizes the quasi-perfect codes. Numerical results concerning the codes with the smallest degree of imperfection are presented.