Lattices Which Are Good for (Almost) Everything
From MaRDI portal
Publication:3546845
DOI10.1109/TIT.2005.855591zbMath1293.94040MaRDI QIDQ3546845
Uri Erez, Ram Zamir, Simon N. Litsyn
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Bounds on codes (94B65) Lattice packing and covering (number-theoretic aspects) (11H31) Source coding (94A29)
Related Items (10)
Coded-BKW: Solving LWE Using Lattice Codes ⋮ Local Testing of Lattices ⋮ Multilevel lattices for compute-and-forward and lattice network coding ⋮ Random coding bound for the second moment of multidimensional lattices ⋮ Lattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function ⋮ Lattice-based locality sensitive hashing is optimal ⋮ Some ``good properties of LDA lattices ⋮ New bounds on the density of lattice coverings ⋮ Complexity and algorithms for computing Voronoi cells of lattices ⋮ Quantum Codes from High-Dimensional Manifolds
This page was built for publication: Lattices Which Are Good for (Almost) Everything
