An Algorithm to Compute the Nearest Point in the Lattice $A_{n}^*$
From MaRDI portal
Publication:3604841
DOI10.1109/TIT.2008.928280zbMath1322.94081arXiv0801.1364MaRDI QIDQ3604841
I. Vaughan L. Clarkson, Robby G. McKilliam, Barry G. Quinn
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0801.1364
Lattices and convex bodies (number-theoretic aspects) (11H06) Combinatorial aspects of matroids and geometric lattices (05B35) Channel models (including quantum) in information and communication theory (94A40) Source coding (94A29)
Related Items
The closest vector problem in tensored root lattices of type A and in their duals ⋮ An optimal algorithm for global optimization and adaptive covering