Antonio Campello
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Antonio Campello has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Sueli Irene Rodrigues Costa
Institute of Mathematics, Statistics and Scientific Computing (IMECC), University of Campinas (Unicamp), Campinas, So Paulo, Brazil
7 shared publications - João Eloir Strapasson
Faculty of Applied Sciences, University of Campinas, Limeira, Brazil
6 shared publications - Grasiele C. Jorge
UNIFESP, Federal University of São Paulo, São José dos Campos, Brazil
3 shared publications - Cristiano Torezzan
School of Applied Sciences, University of Campinas, Sao Paulo, Brazil
2 shared publications - Grasiele Cristiane Jorge
Institute of Mathematics, Statistics and Computer Science University of Campinas 13083-859 São Paulo Brazil
1 shared publication - Ricardo Dahab
UNICAMP
1 shared publication
Latest Publications
- 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.
- Open Access
A Generalization of Montucla's Rectangle-to-Rectangle Dissection to Higher Dimensions
Dissections of polytopes are a well-studied subject by geometers as well as recreational mathematicians. A recent application in coding theory arises from the problem of parameterizing binary vectors of constant Hamming weight which has been shown previously to be equivalent to the problem of dissecting a tetrahedron to a brick. Applications of dissections also arise in problems related to the construction of analog codes. Here we consider the rectangle-to-rectangle dissection due to Montucla. Montucla's dissection is first reinterpreted in terms of the Two Tile Theorem. Based on this, a cube-to-brick dissection is developed in $\mathbb{R}^n$. We present a linear time algorithm (in $n$) that computes the dissection, i.e. determines a point in the cube given a point in a specific realization of the brick. An application of this algorithm to a previously reported analog coding scheme is also discussed.Open AccessA Generalization of Montucla's Rectangle-to-Rectangle Dissection to Higher Dimensions
Dissections of polytopes are a well-studied subject by geometers as well as recreational mathematicians. A recent application in coding theory arises from the problem of parameterizing binary vectors of constant Hamming weight which has been shown previously to be equivalent to the problem of dissecting a tetrahedron to a brick. Applications of dissections also arise in problems related to the construction of analog codes. Here we consider the rectangle-to-rectangle dissection due to Montucla. Montucla's dissection is first reinterpreted in terms of the Two Tile Theorem. Based on this, a cube-to-brick dissection is developed in $\mathbb{R}^n$. We present a linear time algorithm (in $n$) that computes the dissection, i.e. determines a point in the cube given a point in a specific realization of the brick. An application of this algorithm to a previously reported analog coding scheme is also discussed. - Open Access
On projections of arbitrary lattices
In this paper we prove that given any two point lattices $\Lambda_1 \subset \mathbb{R}^n$ and $ \Lambda_2 \subset \nobreak \mathbb{R}^{n-k}$, there is a set of $k$ vectors $\bm{v}_i \in \Lambda_1$ such that $\Lambda_2$ is, up to similarity, arbitrarily close to the projection of $\Lambda_1$ onto the orthogonal complement of the subspace spanned by $\bm{v}_1, \ldots, \bm{v}_k$. This result extends the main theorem of \cite{Sloane2} and has applications in communication theory.Open AccessOn projections of arbitrary lattices
In this paper we prove that given any two point lattices $\Lambda_1 \subset \mathbb{R}^n$ and $ \Lambda_2 \subset \nobreak \mathbb{R}^{n-k}$, there is a set of $k$ vectors $\bm{v}_i \in \Lambda_1$ such that $\Lambda_2$ is, up to similarity, arbitrarily close to the projection of $\Lambda_1$ onto the orthogonal complement of the subspace spanned by $\bm{v}_1, \ldots, \bm{v}_k$. This result extends the main theorem of \cite{Sloane2} and has applications in communication theory. - 18 June 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 59 (10) , 6646-6654
Curves on Flat Tori and Analog Source-Channel Codes
In this paper, we consider the problem of transmitting a continuous alphabet discrete-time source over an additive white Gaussian noise channel in the bandwidth expansion case. We propose a constructive scheme based on a set of curves on the surface of a 2N-dimensional sphere. Our approach shows that the design of good codes for this communication problem relies on geometrical properties of spherical codes and projections of N-dimensional rectangular lattices. Theoretical comparisons with some previous works in terms of the mean squared error as a function of the channel SNR, as well as simulations, are provided.
- 18 June 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 59 (10) , 6646-6654
Curves on Flat Tori and Analog Source-Channel Codes
In this paper, we consider the problem of transmitting a continuous alphabet discrete-time source over an additive white Gaussian noise channel in the bandwidth expansion case. We propose a constructive scheme based on a set of curves on the surface of a 2N-dimensional sphere. Our approach shows that the design of good codes for this communication problem relies on geometrical properties of spherical codes and projections of N-dimensional rectangular lattices. Theoretical comparisons with some previous works in terms of the mean squared error as a function of the channel SNR, as well as simulations, are provided.
- Open Access
On sequences of projections of the cubic lattice
In this paper we study sequences of lattices which are, up to similarity, projections of $\mathbb{Z}^{n+1}$ onto a hyperplane $\bm{v}^{\perp}$, with $\bm{v} \in \mathbb{Z}^{n+1}$ and converge to a target lattice $\Lambda$ which is equivalent to an integer lattice. We show a sufficient condition to construct sequences converging at rate $O(1/ |\bm{v}|^{2/n})$ and exhibit explicit constructions for some important families of lattices.Open AccessOn sequences of projections of the cubic lattice
In this paper we study sequences of lattices which are, up to similarity, projections of $\mathbb{Z}^{n+1}$ onto a hyperplane $\bm{v}^{\perp}$, with $\bm{v} \in \mathbb{Z}^{n+1}$ and converge to a target lattice $\Lambda$ which is equivalent to an integer lattice. We show a sufficient condition to construct sequences converging at rate $O(1/ |\bm{v}|^{2/n})$ and exhibit explicit constructions for some important families of lattices. - 27 March 2013
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 32 (1) , 57-69
On sequences of projections of the cubic lattice
- 27 March 2013
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 32 (1) , 57-69
On sequences of projections of the cubic lattice
- Open Access
Curves on torus layers and coding for continuous alphabet sources
In this paper we consider the problem of transmitting a continuous alphabet discrete-time source over an AWGN channel. The design of good curves for this purpose relies on geometrical properties of spherical codes and projections of $N$-dimensional lattices. We propose a constructive scheme based on a set of curves on the surface of a 2N-dimensional sphere and present comparisons with some previous works.
Open AccessCurves on torus layers and coding for continuous alphabet sources
In this paper we consider the problem of transmitting a continuous alphabet discrete-time source over an AWGN channel. The design of good curves for this purpose relies on geometrical properties of spherical codes and projections of $N$-dimensional lattices. We propose a constructive scheme based on a set of curves on the surface of a 2N-dimensional sphere and present comparisons with some previous works.
- Open Access
LWE-based Identification Schemes
Some hard problems from lattices, like LWE (Learning with Errors), are particularly suitable for application in Cryptography due to the possibility of using worst-case to average-case reductions as evidence of strong security properties. In this work, we show two LWE-based constructions of zero-knowledge identification schemes and discuss their performance and security. We also highlight the design choices that make our solution of both theoretical and practical interest.
Open AccessLWE-based Identification Schemes
Some hard problems from lattices, like LWE (Learning with Errors), are particularly suitable for application in Cryptography due to the possibility of using worst-case to average-case reductions as evidence of strong security properties. In this work, we show two LWE-based constructions of zero-knowledge identification schemes and discuss their performance and security. We also highlight the design choices that make our solution of both theoretical and practical interest.