An algorithm to compute a nearest point in the lattice An

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1719, Issue , 1999, Pages 104-120

  Vaughan, I ^a   Clarkson, L ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA;

NEAREST LATTICE POINT; NEAREST POINT;

ALGORITHMS;

EID: 84957688279     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46796-3_11     Document Type: Conference Paper

References (7)

1. I. Vaughan L. Clarkson. Approximation of Linear Forms by Lattice Points with Applications to Signal Processing. PhD thesis, The Australian National University, 1997.
2. I. Vaughan L. Clarkson, Stephen D. Howard, and Iven M. Y. Mareels. Parameter estimation and association from pulse time-of-arrival data. Submitted to Signal Process., 1997.
3. J. H. Conway and N. J. A. Sloane. Fast quantizing and decoding algorithms for lattice quantizers and codes. IEEE Trans. Inform. Theory, IT-28(2):227-232, March 1982.
4. J. H. Conway and N. J. A. Sloane. Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice. IEEE Trans. Inform. Theory, IT- 32(1):41-50, January 1986.
5. J. H. Conway and N. J. A. Sloane. Sphere Packings, Lattices and Groups. Springer- Verlag, Berlin, 1988.
6. Donald E. Knuth. The Art of Computer Programming, volume 3 (Sorting and Searching). Addison-Wesley, Reading, Ma., 1973.
7. P. van Emde Boas. Another NP-complete partition problem and the complexity of computing short vectors in a lattice. Technical Report 81-04, Mathematisch Instituut, Roetersstraat 15, 1018 WB Amsterdam, The Netherlands, April 1981.