Closest point search in lattices

IEEE Transactions on Information Theory

Volumn 48, Issue 8, 2002, Pages 2201-2214

  Agrell, Erik ^a,b   Eriksson, Thomas ^a,b   Vardy, Alexander ^a,c   Zeger, Kenneth ^a,c  

^a IEEE   (Sweden)

^b CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Closest point search; Kissing number; Korkine Zolotareff (KZ) reduction; Lattice decoding; Lattice quantization; Nearest neighbor; Shortest vector; Voronoi diagram

Indexed keywords

CLOSEST POINT SEARCH METHODS; GENERATOR MATRIX; KANNAN ALGORITHM; KISSING NUMBER; KORKINE-ZOLOTAREFF REDUCTION; LATTICE DECODING; LATTICE QUANTIZATION; POHST ALGORITHM; VITERBO-BOUTROS DECODER; VORONOI DIAGRAM;

ALGORITHMS; CALCULATIONS; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; DECODING; MATRIX ALGEBRA; VECTORS;

INFORMATION THEORY;

EID: 0036670969     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.800499     Document Type: Article

References (86)

1. Calculation of minkowski-reduced lattice bases
2. On the voronoi neighbor ratio for binary linear block codes
3. Optimization of lattices for quantization
4. ML optimal CDMA multiuser receiver
5. Generating hard instances of lattice problems
6. 2 is NP-hard for randomized reductions
7. A public-key cryptosystem with worst-case/average-case equivalence
8. Adaptive entropy constrained lattice vector quantization for multiresolution image coding
9. The hardness of approximate optima in lattices, codes, and systems of linear equations
10. On Lovász lattice reduction and the nearest lattice point problem
11. Trellis complexity and minimal trellis diagrams of lattices
12. On the complexity of decoding lattices using the Korkine-Zolotarev reduced basis
13. Lattices and cryptography
14. Closest vectors, successive minima, and dual HKZ-bases of lattices
15. Good lattice constellations for both Rayleigh fading and Gaussian channels
16. Euclidean space lattice decoding for joint detection in CDMA systems
17. Lattice decoding for joint detection in direct sequence CDMA systems
18. Frequency estimation, phase unwrapping, and the nearest lattice point problem
19. A fast encoding method for lattice codes and quantizers
20. On the voronoi regions of certain lattices
21. Fourier analysis of uniform random number generators
22. Lattice code decoder for space-time codes
23. How to calculate shortest vectors in a lattice
24. An improve lower bound for approximating CVP. Preprint
25. Improved methods for calculating vectors of short length in a lattice, including a complexity analysis
26. A pyramid vector quantizer
27. Geometric source coding and vector quantization
28. The viterbi algorithm
29. Coset codes-Part II: Binary lattices and related codes
30. Lattice quantization
31. Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
32. Chinese remaindering with errors
33. Soft-decision decoding of Chinese remainder codes
34. Algorithms to construct Minkowski reduced and Hermite reduced lattice bases
35. Note on shortest and nearest lattice vectors
36. Extraits de lettres à M. Jacobi sur différents objets de la théorie des nombres (in French)
37. Uniform and piecewise uniform lattice vector quantization for memoryless Guassian and Laplacian sources
38. Improved algorithms for integer programming and related lattice problems
39. Minkowski's convex body theorem and integer programming
40. Successive minimization of the state complexity of the self-dual lattices using Korkine-Zolotarev reduced basis
41. Finding the closest lattice vector when it's unusually close
42. Sur les formes quadratiques (in French)
43. On random rotations diversity and minimum MSE decoding of lattice
44. Factoring polynomials with rational coefficients
45. The shortest vector in a lattice is hard to approximate to within some constant
46. The hardness of the closest vector problem with preprocessing
47. Sur la réduction des formes quadratiques positives quaternaires (in French)
48. Über positive quadratische Formen (in German)
49. Zur Theorie der positiven quadratischen Formen (in German)
50. Allgemeine Lehrsätze über die konvexen Polyeder (in German)
51. Diskontinuitätsbereich für arithmetische Äquivalenz (in German)
52. Maximum likelihood sequence estimation from the lattice viewpoint
53. On the computation of lattice vectors of minimal length, successive minima bases with applications
54. Classical methods in the theory of lattice packings (in Russian)
55. A hierarchy of polynomial time lattice basis reduction algorithms
56. A more efficient algorithm for lattice basis reduction
57. Lattice basis reduction: Improve practical algorithms and solving subset sum problems
58. Attracking the Chor-Rivest cryptosystem by improved lattice reduction
59. Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm
60. Lattice and cryptography; An overview
61. Trlellis complexity versus the coding gain of lattice, Parts I and II
62. Upper bounds on trellis complexity of lattices
63. Another NP-complete partition problem and the complexity of computing short
64. Maximum-likelihood decoding of the Leech lattice
65. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
66. A universal decoding algorithm for lattice codes
67. Computing the Voronoi cell of a lattice: The diamond-cutting algorithm
68. A universal lattice code decoder for fading channels
69. Nouvelles applications des paramètres continus à la théorie des formes quadratiques