The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
Closest point search in lattices
Open accessAbstract
In this semitutorial paper, a comprehensive survey of closest point search methods for lattices without a regular structure is presented. The existing search strategies are described in a unified framework, and differences between them are elucidated. An efficient closest point search algorithm, based on the Schnorr-Euchner (1995) variation of the Pohst (1981) method, is implemented. Given an arbitrary point x /spl isin/ /spl Ropf//sup m/ and a generator matrix for a lattice /spl Lambda/, the algorithm computes the point of /spl Lambda/ that is closest to x. The algorithm is shown to be substantially faster than other known methods, by means of a theoretical comparison with the Kannan (1983, 1987) algorithm and an experimental comparison with the Pohst (1981) algorithm and its variants, such as the Viterbo-Boutros (see ibid. vol.45, p.1639-42, 1999) decoder. Modifications of the algorithm are developed to solve a number of related search problems for lattices, such as finding a shortest vector, determining the kissing number, computing the Voronoi (1908)-relevant vectors, and finding a Korkine-Zolotareff (1873) reduced basis.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
Vector Quantization and Signal Compression
Gersho, A., & Gray, R. M. (1992) · Springer eBooks · doi:10.1007/978-1-4615-3626-0 · Cited by 7,003
Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
Viterbi, A. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1054010 · Cited by 6,759
An Introduction to Probability Theory and Its Applications.
Bharucha-Reid, A. T., & Feller, W. (1967) · The American Mathematical Monthly · doi:10.2307/2314609 · Cited by 6,066
The Art of Computer Programming
Whitesides, G. E. (1970) · Nuclear Science and Engineering · doi:10.13182/nse70-a19705 · Cited by 6,008
Forney, G. D. (1973) · Proceedings of the IEEE · doi:10.1109/proc.1973.9030 · Cited by 5,647
Factoring polynomials with rational coefficients
Lenstra, A. K., Lenstra, H. W., & Lovász, L. (1982) · Mathematische Annalen · doi:10.1007/bf01457454 · Cited by 4,018
A Course in Computational Algebraic Number Theory
Cohen, H. (1993) · Graduate Texts in Mathematics · doi:10.1007/978-3-662-02945-9 · Cited by 2,567
Applied Numerical Linear Algebra
Demmel, J. W. (1997) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971446 · Cited by 2,299
Sphere Packings, Lattices and Groups
Conway, J. H., & Sloane, N. J. A. (1999) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-1-4757-6568-7 · Cited by 2,223
Cited by
Space-Time Block Coding for Wireless Communications
Larsson, E. G., & Stoica, P. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511550065 · Cited by 1,035
Fifty Years of MIMO Detection: The Road to Large-Scale MIMOs
Yang, S., & Hanzo, L. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2475242 · Cited by 814
Achieving<tex>$ 1over 2log (1+ hboxSNR)$</tex>on the AWGN Channel With Lattice Encoding and Decoding
Erez, U., & Zamir, R. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.834787 · Cited by 732
On the complexity of sphere decoding in digital communications
Jalden, J., & Ottersten, B. (2005) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2005.843746 · Cited by 720
Samuel, N., Diskin, T., & Wiesel, A. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2899805 · Cited by 515
Samuel, N., Diskin, T., & Wiesel, A. (2017) · 2017 IEEE 18th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) · doi:10.1109/spawc.2017.8227772 · Cited by 429
Next Generation Wireless LANs: 802.11n and 802.11ac
Perahia, E., & Stacey, R. (2013) · Cambridge University Press eBooks · doi:10.1017/cbo9781139061407 · Cited by 429
MLAMBDA: a modified LAMBDA method for integer least-squares estimation
Chang, X. W., Yang, X., & Zhou, T. (2005) · Journal of Geodesy · doi:10.1007/s00190-005-0004-x · Cited by 423
Large-Scale MIMO Detection for 3GPP LTE: Algorithms and FPGA Implementations
Wu, M., Yin, B., Wang, G., Dick, C., Cavallaro, J. R., & Studer, C. (2014) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2014.2313021 · Cited by 409
Quantized Precoding for Massive MU-MIMO
Jacobsson, S., Durisi, G., Coldrey, M., Goldstein, T., & Studer, C. (2017) · IEEE Transactions on Communications · doi:10.1109/tcomm.2017.2723000 · Cited by 367
Locality sensitive hashing: A comparison of hash function types and querying mechanisms
Paulevé, L., Jégou, H., & Amsaleg, L. (2010) · Pattern Recognition Letters · doi:10.1016/j.patrec.2010.04.004 · Cited by 297
Lattice Enumeration Using Extreme Pruning
Gama, N., Nguyen, P. Q., & Regev, O. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_13 · Cited by 284
Metadata
- Authors
- Agrell, E., Eriksson, T., Vardy, A., & Zeger, K.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2002-08
- Volume
- 48
- Issue
- 8
- Pages
- 2201-2214
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2140940105
- Cited by
- 1,412
- References
- 44
- FWCI
- 145.61
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.