Interactive Nearest Lattice Point Search in a Distributed Setting: Two Dimensions

The nearest lattice point problem in <inline-formula> <tex-math notation="LaTeX">\mathbb {R}^{n} </tex-math></inline-formula> is formulated in a distributed network with <inline-formula> <tex-math notation="LaTeX">n </tex-math></inline...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on communications Vol. 70; no. 8; pp. 5128 - 5139
Main Authors:	Vaishampayan, Vinay A., Bollauf, Maiara F.
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.08.2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Communication communication complexity Computer networks Costs distributed compression distributed function computation Error probability Generators Hexagonal lattice lattice quantization Lattices Matrix decomposition nearest lattice point problem Protocols Quantization (signal)
ISSN:	0090-6778, 1558-0857
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!