activity
20172022
most citedCommunication Cost of Transforming a Nearest Plane Partition to the Voronoi Partition

6 citations · 13 across the 5 of their papers we have counts for

collaborators

8 papers

cs.IT2022

On the Secrecy Gain of Formally Unimodular Construction Lattices

Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus

Lattice coding for the Gaussian wiretap channel is considered, where the goal is to ensure reliable communication between two authorized parties while preventing an eavesdropper fr…

cs.IT20213 cited

The Secrecy Gain of Formally Unimodular Lattices on the Gaussian Wiretap Channel

Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus

We consider lattice coding for the Gaussian wiretap channel, where the challenge is to ensure reliable communication between two authorized parties while preventing an eavesdropper…

cs.IT2021

Tiling of Constellations

Maiara F. Bollauf, Øyvind Ytrehus

Motivated by applications in reliable and secure communication, we address the problem of tiling (or partitioning) a finite constellation in by subsets, in the…

cs.IT2020

On Communication for Distributed Babai Point Computation

Maiara F. Bollauf, Vinay A. Vaishampayan, Sueli I. R. Costa

We present a communication-efficient distributed protocol for computing the Babai point, an approximate nearest point for a random vector in a given lattic…

cs.IT2018

Multilevel constructions: coding, packing and geometric uniformity

Maiara Francine Bollauf, Ram Zamir, Sueli Irene Rodrigues Costa

Lattice and special nonlattice multilevel constellations constructed from binary codes, such as Constructions A, C, and D, have relevant applications in Mathematics (sphere packing…

cs.IT20181 cited

Communication-Efficient Search for an Approximate Closest Lattice Point

Maiara F. Bollauf, Vinay A. Vaishampayan, Sueli I. R. Costa

We consider the problem of finding the closest lattice point to a vector in n-dimensional Euclidean space when each component of the vector is available at a distinct node in a net…