Closest point search in lattices

2002 · IEEE Transactions on Information Theory · 1,450 citations · 0 from inside this corpus

Erik Agrell, Thomas Eriksson, Alexander Vardy, K. Zeger

The source holds an abstract for this work, but its best open-access copy is under no open licence, which does not permit us to republish the text. Read it at the source below.

4 of 4 neighbouring works in this corpus. Blue is what this paper cites; orange is what cites it, and a dashed line is one neighbour citing another. Only the largest labels are drawn — every node carries its full title on hover.

this paper works it cites works citing it node size = global citations · hover for the full title

What this paper cites, inside the corpus

Paper	Year	Cited
An Introduction to Probability Theory and Its Applications.	1967	6,200
Factoring polynomials with rational coefficients	1982	4,041
A universal lattice code decoder for fading channels	1999	1,563
Lattice basis reduction: Improved practical algorithms and solving subset sum problems	1994	1,429

Links

DOI · Open access copy · OpenAlex record

Topics

Coding theory and cryptography	Computer Science
Algorithms and Data Compression	Computer Science
graph theory and CDMA systems	Engineering

Is this record sound?

complete

Nothing in this record contradicts itself and no field we check is missing.

supports4 author record(s) attached.
supports88 reference(s) recorded.
supportsThe DOI's year agrees with the publication year.
supportsA title is present.

Provenance

Everything above was read from one stored OpenAlex payload, fetched 2026-09-04T03:58:58+00:00.

sha256 88a60cdbb94c6a13…