Maiara F. Bollauf

Orcid: 0000-0002-6195-492X

According to our database1, Maiara F. Bollauf authored at least 22 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the Maximum Theta Series over Unimodular Lattices.
CoRR, 2024

2023
Formally Unimodular Packings for the Gaussian Wiretap Channel.
IEEE Trans. Inf. Theory, December, 2023

Linearity of Gray Codes via Schur Product.
CoRR, 2023

Secrecy Gain of Formally Unimodular Lattices from Codes over the Integers Modulo 4.
CoRR, 2023

Construction and Secrecy Gain of Formally Unimodular Lattices in Odd Dimensions.
Proceedings of the IEEE Information Theory Workshop, 2023

On the Secrecy Gain of Isodual Lattices from Tail-Biting Convolutional Codes.
Proceedings of the 12th International Symposium on Topics in Coding, 2023

2022
Interactive Nearest Lattice Point Search in a Distributed Setting: Two Dimensions.
IEEE Trans. Commun., 2022

On the Secrecy Gain of Formally Unimodular Construction A<sub>4</sub> Lattices.
CoRR, 2022

On the Secrecy Gain of Formally Unimodular Construction A4 Lattices.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
On Communication for Distributed Babai Point Computation.
IEEE Trans. Inf. Theory, 2021

The Secrecy Gain of Formally Unimodular Lattices on the Gaussian Wiretap Channel.
CoRR, 2021

Tiling of Constellations.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Construction C<sup>*</sup> from Self-Dual Codes.
CoRR, 2020

Lattice Construction C<sup>⋆</sup> from Self-Dual Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Multilevel Constructions: Coding, Packing and Geometric Uniformity.
IEEE Trans. Inf. Theory, 2019

New Bounds for GLD Lattices and Codes.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

2018
On the Interactive Communication Cost of the Distributed Nearest Lattice Point Problem.
CoRR, 2018

Communication-Efficient Search for an Approximate Closest Lattice Point.
CoRR, 2018

2017
Construction C*: an improved version of Construction C.
CoRR, 2017

Communication cost of transforming a nearest plane partition to the Voronoi partition.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

On the communication cost of determining an approximate nearest lattice point.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Uniformity properties of Construction C.
Proceedings of the IEEE International Symposium on Information Theory, 2016


  Loading...