default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaiara F. Bollauf
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j5]Maiara F. Bollauf
, Hsuan-Yin Lin, Øyvind Ytrehus:
Secrecy Gain of Formally Unimodular Lattices From Codes Over the Integers Modulo 4. IEEE Trans. Inf. Theory 70(5): 3309-3329 (2024)- 2023
- [j4]Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus:
Formally Unimodular Packings for the Gaussian Wiretap Channel. IEEE Trans. Inf. Theory 69(12): 7755-7776 (2023) - 2022
- [j3]Vinay A. Vaishampayan, Maiara F. Bollauf:
Interactive Nearest Lattice Point Search in a Distributed Setting: Two Dimensions. IEEE Trans. Commun. 70(8): 5128-5139 (2022) - 2021
- [j2]Maiara F. Bollauf, Vinay A. Vaishampayan, Sueli I. R. Costa:
On Communication for Distributed Babai Point Computation. IEEE Trans. Inf. Theory 67(10): 6408-6424 (2021) - 2019
- [j1]Maiara F. Bollauf, Ram Zamir, Sueli I. R. Costa:
Multilevel Constructions: Coding, Packing and Geometric Uniformity. IEEE Trans. Inf. Theory 65(12): 7669-7681 (2019)
Conference and Workshop Papers
- 2024
- [c10]Gustavo Terra Bastos, Maiara F. Bollauf, Agnaldo José Ferrari, Øyvind Ytrehus:
Nested Construction of $\mathbb{Z}_{2^{L}} \text{-Linear}$ Codes. ISIT 2024: 2598-2603 - 2023
- [c9]Palma Persson, Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus:
On the Secrecy Gain of Isodual Lattices from Tail-Biting Convolutional Codes. ISTC 2023: 1-5 - [c8]Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus:
Construction and Secrecy Gain of Formally Unimodular Lattices in Odd Dimensions. ITW 2023: 186-191 - 2022
- [c7]Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus:
On the Secrecy Gain of Formally Unimodular Construction A4 Lattices. ISIT 2022: 3226-3231 - 2021
- [c6]Maiara F. Bollauf, Øyvind Ytrehus:
Tiling of Constellations. ISIT 2021: 450-454 - 2020
- [c5]Maiara F. Bollauf, Sueli I. R. Costa, Ram Zamir:
Lattice Construction C⋆ from Self-Dual Codes. ISIT 2020: 537-541 - 2019
- [c4]Maiara F. Bollauf, Joseph J. Boutros, Nordine Mir:
New Bounds for GLD Lattices and Codes. ITW 2019: 1-5 - 2017
- [c3]Maiara F. Bollauf, Vinay A. Vaishampayan, Sueli I. R. Costa:
On the communication cost of determining an approximate nearest lattice point. ISIT 2017: 1838-1842 - [c2]Vinay A. Vaishampayan, Maiara F. Bollauf:
Communication cost of transforming a nearest plane partition to the Voronoi partition. ISIT 2017: 1843-1847 - 2016
- [c1]Maiara F. Bollauf, Ram Zamir:
Uniformity properties of Construction C. ISIT 2016: 1516-1520
Informal and Other Publications
- 2024
- [i16]Maiara F. Bollauf, Hsuan-Yin Lin:
On the Maximum Theta Series over Unimodular Lattices. CoRR abs/2403.16932 (2024) - 2023
- [i15]Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus:
Secrecy Gain of Formally Unimodular Lattices from Codes over the Integers Modulo 4. CoRR abs/2303.08083 (2023) - [i14]Gustavo Terra Bastos, Maiara F. Bollauf, Agnaldo José Ferrari:
Linearity of Gray Codes via Schur Product. CoRR abs/2309.12291 (2023) - 2022
- [i13]Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus:
On the Secrecy Gain of Formally Unimodular Construction A4 Lattices. CoRR abs/2202.09236 (2022) - [i12]Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus:
Formally Unimodular Packings for the Gaussian Wiretap Channel. CoRR abs/2206.14171 (2022) - 2021
- [i11]Maiara F. Bollauf, Øyvind Ytrehus:
Tiling of Constellations. CoRR abs/2105.04253 (2021) - [i10]Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus:
The Secrecy Gain of Formally Unimodular Lattices on the Gaussian Wiretap Channel. CoRR abs/2111.01439 (2021) - 2020
- [i9]Maiara Francine Bollauf, Sueli Irene Rodrigues Costa, Ram Zamir:
Construction C* from Self-Dual Codes. CoRR abs/2005.07291 (2020) - [i8]Maiara F. Bollauf, Vinay A. Vaishampayan, Sueli I. R. Costa:
On Communication for Distributed Babai Point Computation. CoRR abs/2008.13075 (2020) - 2018
- [i7]Maiara F. Bollauf, Vinay A. Vaishampayan, Sueli I. R. Costa:
Communication-Efficient Search for an Approximate Closest Lattice Point. CoRR abs/1801.09796 (2018) - [i6]Vinay A. Vaishampayan, Maiara F. Bollauf:
On the Interactive Communication Cost of the Distributed Nearest Lattice Point Problem. CoRR abs/1801.10491 (2018) - [i5]Maiara Francine Bollauf, Ram Zamir, Sueli Irene Rodrigues Costa:
Multilevel constructions: coding, packing and geometric uniformity. CoRR abs/1806.05715 (2018) - 2017
- [i4]Maiara F. Bollauf, Vinay A. Vaishampayan, Sueli I. R. Costa:
On the Communication Cost of Determining an Approximate Nearest Lattice Point. CoRR abs/1701.08456 (2017) - [i3]Vinay A. Vaishampayan, Maiara F. Bollauf:
Communication Cost of Transforming a Nearest Plane Partition to the Voronoi Partition. CoRR abs/1701.08458 (2017) - [i2]Maiara F. Bollauf, Ram Zamir:
Construction C*: an improved version of Construction C. CoRR abs/1709.06640 (2017) - 2016
- [i1]Maiara F. Bollauf, Ram Zamir:
Uniformity Properties of Construction C. CoRR abs/1602.01648 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-13 17:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
