6 citations · 15 across the 14 of their papers we have counts for
18 papers
Coset Shaping: Constructions and Bounds
Irina Bocharova, Maiara F. Bollauf, Boris Kudryashov
A new geometric shaping technique, referred to as coset shaping, is proposed and analyzed for coded QAM and PAM signaling. This method can be applied to both information and parity…
Generalized Theta Series of a Lattice
Maiara F. Bollauf, Hsuan-Yin Lin
Mimicking the idea of the generalized Hamming weight of linear codes, we introduce a new lattice invariant, the generalized theta series. Applications range from identifying stable…
On the Maximum Flatness Factor over Unimodular Lattices
Maiara F. Bollauf, Hsuan-Yin Lin
The theta series of a lattice is a power series that characterizes the number of lattice vectors at certain norms. It is closely related to a critical quantity widely used in physi…
Linearity of -Linear Codes via Schur Product
Gustavo T. Bastos, Maiara F. Bollauf, Agnaldo J. Ferrari +1
We propose an innovative approach to investigating the linearity of -linear codes derived from -additive codes using the generalized Gray map. T…
Secrecy Gain of Formally Unimodular Lattices from Codes over the Integers Modulo 4
Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus
Recently, a design criterion depending on a lattice's volume and theta series, called the secrecy gain, was proposed to quantify the secrecy-goodness of the applied lattice code fo…
Formally Unimodular Packings for the Gaussian Wiretap Channel
Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus
This paper introduces the family of lattice-like packings, which generalizes lattices, consisting of packings possessing periodicity and geometric uniformity. The subfamily of form…
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…
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…
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…
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…
Construction from Self-Dual Codes
Maiara Francine Bollauf, Sueli Irene Rodrigues Costa, Ram Zamir
Construction was recently introduced as a generalization of the multilevel Construction C (or Forney's code-formula), such that the coded levels may be dependent. Both co…
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…
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…
Interactive Nearest Lattice Point Search in a Distributed Setting: Two Dimensions
V. A. Vaishampayan, M. F. Bollauf
The nearest lattice point problem in is formulated in a distributed network with nodes. The objective is to minimize the probability that an incorrect lattice po…
Construction C*: an inter-level coded version of Construction C
Maiara Francine Bollauf, Ram Zamir, Sueli Irene Rodrigues Costa
Besides all the attention given to lattice constructions, it is common to find some very interesting nonlattice constellations, as Construction C, for example, which also has relev…
Communication Cost of Transforming a Nearest Plane Partition to the Voronoi Partition
V. A. Vaishampayan, M. F. Bollauf
We consider the problem of distributed computation of the nearest lattice point for a two dimensional lattice. An interactive model of communication is considered. We address the p…
On the Communication Cost of Determining an Approximate Nearest Lattice Point
M. F. Bollauf, V. A. Vaishampayan, S. I. R. Costa
We consider the closest lattice point problem in a distributed network setting and study the communication cost and the error probability for computing an approximate nearest latti…
Uniformity Properties of Construction C
Maiara F. Bollauf, Ram Zamir
Construction C (also known as Forney's multi-level code formula) forms a Euclidean code for the additive white Gaussian noise (AWGN) channel from binary code components. If the…