On the communication cost of determining an approximate nearest lattice point

@article{Bollauf2017OnTC,
  title={On the communication cost of determining an approximate nearest lattice point},
  author={M. F. Bollauf and V. Vaishampayan and S. Costa},
  journal={2017 IEEE International Symposium on Information Theory (ISIT)},
  year={2017},
  pages={1838-1842}
}
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… Expand
7 Citations
Communication-Efficient Search for an Approximate Closest Lattice Point
  • 1
  • PDF
Communication cost of transforming a nearest plane partition to the Voronoi partition
  • 7
  • PDF
On the Interactive Communication Cost of the Distributed Nearest Lattice Point Problem
  • PDF
Towards a Converse for the Nearest Lattice Point Problem
  • 1
  • PDF
On Communication for Distributed Babai Point Computation
  • PDF
Classification in a Large Network
  • V. Vaishampayan
  • Mathematics, Computer Science
  • 2019 IEEE International Symposium on Information Theory (ISIT)
  • 2019
  • PDF

References

SHOWING 1-10 OF 19 REFERENCES
Communication cost of transforming a nearest plane partition to the Voronoi partition
  • 7
  • PDF
Closest point search in lattices
  • 1,423
  • PDF
On Lovász’ lattice reduction and the nearest lattice point problem
  • L. Babai
  • Mathematics, Computer Science
  • Comb.
  • 1986
  • 905
Information Theoretic Bounds for Distributed Computation Over Networks of Point-to-Point Channels
  • 42
  • PDF
Sphere packings, I
  • T. Hales
  • Mathematics, Computer Science
  • Discret. Comput. Geom.
  • 1997
  • 1,432
  • PDF
Some Results on Distributed Source Coding for Interactive Function Computation
  • N. Ma, P. Ishwar
  • Mathematics, Computer Science
  • IEEE Transactions on Information Theory
  • 2011
  • 90
A Mathematical Theory of Communication
  • 44,340
  • PDF
On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
  • M. Pohst
  • Mathematics, Computer Science
  • SIGS
  • 1981
  • 333
Communication Complexity
  • 679
  • PDF
Factoring polynomials with rational coefficients
  • 3,779
  • PDF
...
1
2
...