Maiara F. Bollauf

Dr. Maiara F. Bollauf


Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 August 2019 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
MBMaiara F. Bollauf
Maiara F. Bollauf
RZRam Zamir
Ram Zamir
SCSueli Costa
Sueli 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) and in Communication (multi-stage decoding and efficient vector quantization). In this work, we explore some properties of Construction C, in particular its geometric uniformity. We then propose a new multilevel construction, inspired by bit interleaved coded modulation (BICM), that we call Construction C⋆. We investigate the geometric uniformity, latticeness, and minimum distance properties of Construction C⋆, and discuss its superior packing efficiency when compared to Construction C.

1 June 2017
Verified
Conference Paper
Closed access
MBMaiara F. Bollauf
Maiara F. Bollauf
VVVinay A. Vaishampayan
Vinay A. Vaishampayan
SCSueli Costa
Sueli 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 lattice point, using the nearest-plane algorithm, due to Babai. Two distinct communication models, centralized and interactive, are considered. The importance of proper basis selection is addressed. Assuming a reduced basis for a two-dimensional lattice, we determine the approximation error of the nearest plane algorithm. The communication cost for determining the Babai point, or equivalently, for constructing the rectangular nearest-plane partition, is calculated in the interactive setting. For the centralized model, an algorithm is presented for reducing the communication cost of the nearest plane algorithm in an arbitrary number of dimensions.

1 June 2017
Verified
Conference Paper
Closed access
VVVinay A. Vaishampayan
Vinay A. Vaishampayan
MBMaiara F. Bollauf
Maiara 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 problem of reconfiguring a specific rectangular partition, a nearest plane, or Babai, partition, into the Voronoi partition. Expressions are derived for the error probability as a function of the total number of communicated bits. With an infinite number of allowed communication rounds, the average cost of achieving zero error probability is shown to be finite. For the interactive model, with a single round of communication, expressions are obtained for the error probability as a function of the bits exchanged. We observe that the error exponent depends on the lattice.

9 October 2023 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
MBMaiara F. Bollauf
Maiara F. Bollauf
Hsuan-Yin LinHsuan-Yin Lin
Hsuan-Yin Lin
ØYØyvind Ytrehus
Ø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 formally unimodular (lattice-like) packings is further investigated. It can be seen as a generalization of the unimodular and isodual lattices , and the Construction A formally unimodular packings obtained from formally self-dual codes are presented. Recently, lattice coding for the Gaussian wiretap channel has been considered. A measure called the secrecy function was proposed to characterize the eavesdropper’s probability of correctly decoding. The aim is to determine the global maximum value of the secrecy function, called (strong) secrecy gain . We further apply lattice-like packings to coset coding for the Gaussian wiretap channel and show that the family of formally unimodular packings shares the same secrecy function behavior as unimodular and isodual lattices. We propose a universal approach to determine the secrecy gain of a Construction A formally unimodular packing obtained from a formally self-dual code. From the weight distribution of a code, we provide a necessary condition for a formally self-dual code such that its Construction A formally unimodular packing is secrecy-optimal. Finally, we demonstrate that formally unimodular packings/lattices can achieve higher secrecy gain than the best-known unimodular lattices.

11 August 2016
Verified
Conference Paper
Closed access
MBMaiara F. Bollauf
Maiara F. Bollauf
RZRam Zamir
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 L binary code components. If the component codes are linear, then the minimum distance is the same for all the points, although the kissing number may vary. In fact, while in the single level (L = 1) case it reduces to lattice Construction A, a multi-level Construction C is in general not a lattice. We show that the two-level (L = 2) case is special: a two-level Construction C satisfies Forney's definition for a geometrically uniform constellation. Specifically, every point sees the same configuration of neighbors, up to a reflection of the coordinates in which the lower level code is equal to 1. In contrast, for three levels and up (L ≥ 3), we construct examples where the distance spectrum varies between the points, hence the constellation is not geometrically uniform.

18 March 2024 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
MBMaiara F. Bollauf
Maiara F. Bollauf
Hsuan-Yin LinHsuan-Yin Lin
Hsuan-Yin Lin
ØYØyvind Ytrehus
Ø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 for the Gaussian wiretap channel. To address the secrecy gain of Construction A4 lattices from formally self-dual $ \mathbb {Z}_{4}$ -linear codes, i.e., codes for which the symmetrized weight enumerator (swe) coincides with the swe of its dual, we present new constructions of $ \mathbb {Z}_{4}$ -linear codes which are formally self-dual with respect to the swe. For even lengths, formally self-dual $ \mathbb {Z}_{4}$ -linear codes are constructed from nested binary codes and double circulant matrices. For odd lengths, a novel construction called odd extension from double circulant codes is proposed. Moreover, the concepts of Type I/II formally self-dual codes/unimodular lattices are introduced. Next, we derive the theta series of the formally unimodular lattices obtained by Construction A4 from formally self-dual $ \mathbb {Z}_{4}$ -linear codes and describe a universal approach to determine their secrecy gains. The secrecy gain of Construction A4 formally unimodular lattices obtained from formally self-dual $ \mathbb {Z}_{4}$ -linear codes is investigated, both for even and odd dimensions. Numerical evidence shows that for some parameters, Construction A4 lattices can achieve a higher secrecy gain than the best-known formally unimodular lattices from the literature. Results concerning the flatness factor, another security criterion widely considered in the Gaussian wiretap channel, are also discussed.