Linear-Time Nearest Point Algorithms for Coxeter Lattices

DOI10.1109/TIT.2009.2039090zbMath1366.94396arXiv0903.0673MaRDI QIDQ5281564

I. Vaughan L. Clarkson, Robby G. McKilliam, Warren D. Smith

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0903.0673

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Lattices and convex bodies (number-theoretic aspects) (11H06) Channel models (including quantum) in information and communication theory (94A40)

Related Items (1)

Error correction and ciphertext quantization in lattice cryptography

This page was built for publication: Linear-Time Nearest Point Algorithms for Coxeter Lattices