8 citations · 29 across the 12 of their papers we have counts for
16 papers
Semantically Secure Lattice Codes for Compound MIMO Channels
Antonio Campello, Cong Ling, Jean-Claude Belfiore
We consider compound multi-input multi-output (MIMO) wiretap channels where minimal channel state information at the transmitter (CSIT) is assumed. Code construction is given for t…
Ring Compute-and-Forward over Block-Fading Channels
Shanxiang Lyu, Antonio Campello, Cong Ling
The Compute-and-Forward protocol in quasi-static channels normally employs lattice codes based on the rational integers , Gaussian integers o…
AWGN-Goodness is Enough: Capacity-Achieving Lattice Codes based on Dithered Probabilistic Shaping
Antonio Campello, Daniel Dadush, Cong Ling
In this paper we show that any sequence of infinite lattice constellations which is good for the unconstrained Gaussian channel can be shaped into a capacity-achieving sequence of…
Compute-and-Forward over Block-Fading Channels Using Algebraic Lattices
Shanxiang Lyu, Antonio Campello, Cong Ling +1
Previous approaches to compute-and-forward (C\&F) are mostly based on quantizing channel coefficients to integers. In this work, we investigate the C\&F strategy over block fading…
Random Ensembles of Lattices from Generalized Reductions
Antonio Campello
We propose a general framework to study constructions of Euclidean lattices from linear codes over finite fields. In particular, we prove general conditions for an ensemble constru…
Multilevel Code Construction for Compound Fading Channels
Antonio Campello, Ling Liu, Cong Ling
We consider explicit constructions of multi-level lattice codes that universally approach the capacity of the compound block-fading channel. Specifically, building on algebraic par…
Universal Lattice Codes for MIMO Channels
Antonio Campello, Cong Ling, Jean-Claude Belfiore
We propose a coding scheme that achieves the capacity of the compound MIMO channel with algebraic lattices. Our lattice construction exploits the multiplicative structure of number…
Quasi-perfect codes in the metric
João E. Strapasson, Grasiele C. Jorge, Antonio Campello +1
We consider quasi-perfect codes in over the metric, . Through a computational approach, we determine all radii for which there are linear…
A Generalization of Montucla's Rectangle-to-Rectangle Dissection to Higher Dimensions
Antonio Campello, Vinay A. Vaishampayan
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 parameteri…
Perfect codes in the lp metric
Antonio Campello, Grasiele C. Jorge, and João Strapasson +1
We investigate perfect codes in under the metric. Upper bounds for the packing radius of a linear perfect code, in terms of the metric parameter and…
Reliability of Erasure Coded Storage Systems: A Geometric Approach
Antonio Campello, Vinay A. Vaishampayan
We consider the probability of data loss, or equivalently, the reliability function for an erasure coded distributed data storage system under worst case conditions. Data loss in a…
Curves on Flat Tori and Analog Source-Channel Codes
Antonio Campello, Cristiano Torezzan, Sueli I. R. Costa
In this paper we consider the problem of transmitting a continuous alphabet discrete-time source over an AWGN channel. We propose a constructive scheme based on a set of curves on…
On projections of arbitrary lattices
Antonio Campello, João Strapasson, Sueli Costa
In this paper we prove that given any two point lattices and , there is a set of vectors s…
Curves on torus layers and coding for continuous alphabet sources
Antonio Campello, Cristiano Torezzan, Sueli I. R. Costa
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 geometri…
On sequences of projections of the cubic lattice
Antonio Campello, João Strapasson
In this paper we study sequences of lattices which are, up to similarity, projections of onto a hyperplane , with a…
LWE-based Identification Schemes
Rosemberg Silva, Antonio Campello, Ricardo Dahab
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-c…