Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Maiara F. Bollauf"'
Publikováno v:
IEEE Transactions on Information Theory. 65:7669-7681
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 quan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::df16834981d055601c7fe849c3842bee
https://doi.org/10.1109/tit.2019.2933219
https://doi.org/10.1109/tit.2019.2933219
Autor:
Maiara F. Bollauf, Øyvind Ytrehus
Publikováno v:
ISIT
Motivated by applications in reliable and secure communication, we address the problem of tiling (or partitioning) a finite constellation in $\mathbb{Z}_{2^{L}}^{n}$ by subsets, in the case that the constellation does not possess an abelian group str
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::203cbe887f16dee45fcd7af5f02968af
Publikováno v:
ISIT
Construction C⋆ 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 constructions do not produce a lattice in general, hence the central idea o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aad90a72217edc3025edcc7203a19f18
https://doi.org/10.1109/isit44484.2020.9174473
https://doi.org/10.1109/isit44484.2020.9174473
We present a communication-efficient distributed protocol for computing the Babai point, an approximate nearest point for a random vector ${\mathbf{X}}\in \mathbb {R}^{n}$ in a given lattice. We show that the protocol is optimal in the sense that it
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::82125bedd44e2e9a0548e23cb2a473f3
Publikováno v:
ITW
We prove that the ensemble of random Generalized Low-Density (GLD) lattices can attain the Poltyrev limit for an alphabet size increasing polylogarithmically with the lattice dimension. Our main theorem imposes no constraints on the normalized minimu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::addecff42701fb21fc624cd864edda71
https://doi.org/10.1109/itw44776.2019.8989412
https://doi.org/10.1109/itw44776.2019.8989412
Publikováno v:
ISIT
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 pl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::22fd52a75dd95085bd6223f367f8115d
https://doi.org/10.1109/isit.2017.8006848
https://doi.org/10.1109/isit.2017.8006848
Publikováno v:
ISIT
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 distinc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d199aa01e3b1ecf53e1b5a422aa3a9e4
https://doi.org/10.1109/isit.2017.8006847
https://doi.org/10.1109/isit.2017.8006847