The DOI matches its Crossref record.
Improved methods for calculating vectors of short length in a lattice, including a complexity analysis
Open accessAbstract
The standard methods for calculating vectors of short length in a lattice use a reduction procedure followed by enumerating all vectors of Z m in a suitable box. However, it suffices to consider those x ∈ Z m which lie in a suitable ellipsoid having a much smaller volume than the box. We show in this paper that searching through that ellipsoid is in many cases much more efficient. If combined with an appropriate reduction procedure our method allows to do computations in lattices of much higher dimensions. Several randomly constructed numerical examples illustrate the superiority of our new method over the known ones.
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
Cited by
Scaling Up MIMO: Opportunities and Challenges with Very Large Arrays
Rusek, F., Persson, D., Lau, B. K., Larsson, E. G., Marzetta, T. L., & Tufvesson, F. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2011.2178495 · Cited by 4,654
An Overview of MIMO Communications—A Key to Gigabit Wireless
Paulraj, A. J., Gore, D. A., Nabar, R. U., & Bolcskei, H. (2004) · Proceedings of the IEEE · doi:10.1109/jproc.2003.821915 · Cited by 2,086
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
An introduction to convex optimization for communications and signal processing
Luo, Z.-Q., & Yu, W. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.879347 · Cited by 562
Foundations of MIMO Communication
Heath Jr, R. W., & Lozano, A. (2018) · Cambridge University Press eBooks · doi:10.1017/9781139049276 · Cited by 426
Metadata
- Authors
- Fincke, U., & Pohst, M.
- Venue
- Mathematics of Computation
- Publisher
- American Mathematical Society (AMS)
- Published
- 1985
- Volume
- 44
- Issue
- 170
- Pages
- 463-471
- ISSN
- 0025-5718 (ISSN-L)
- 1088-6842
- OpenAlex
- W1997002146
- Cited by
- 1,458
- References
- 0
- FWCI
- 5.00
- Type
- journal article
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Improved methods for calculating vectors of short length in a lattice, including a complexity analysis. https://app.cochat.ai/papers/10.1090/s0025-5718-1985-0777278-8
- The paper
- Fincke, U., & Pohst, M. (1985). Improved methods for calculating vectors of short length in a lattice, including a complexity analysis. Mathematics of Computation. https://doi.org/10.1090/s0025-5718-1985-0777278-8
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.