The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
Open accessAbstract
The problem of determining shortest vectors and reduced bases or successive minima of lattices often occurs in algebra and number theory. Nevertheless, computational methods for the solution hardly exist in the literature. It is the aim of this paper to develop efficient algorithms for this purpose.
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
Plesken, W., & Pohst, M. E. (1980) · Mathematics of Computation · doi:10.1090/s0025-5718-1980-0551305-0 · Cited by 11
Self-citation
Cited by
Achieving near-capacity on a multiple-antenna channel
Hochwald, B. M., & ten Brink, S. (2003) · IEEE Transactions on Communications · doi:10.1109/tcomm.2003.809789 · Cited by 2,033
Fincke, U., & Pohst, M. (1985) · Mathematics of Computation · doi:10.1090/s0025-5718-1985-0777278-8 · Cited by 1,458
Self-citationClosest point search in lattices
Agrell, E., Eriksson, T., Vardy, A., & Zeger, K. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.800499 · Cited by 1,412
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
BKZ 2.0: Better Lattice Security Estimates
Chen, Y., & Nguyen, P. Q. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25385-0_1 · Cited by 598
Metadata
- Authors
- Pohst, M.
- Venue
- ACM SIGSAM Bulletin
- Published
- 1981-02
- Volume
- 15
- Issue
- 1
- Pages
- 37-44
- ISSN
- 0163-5824 (ISSN-L)
- OpenAlex
- W1997086908
- Cited by
- 352
- References
- 1
- FWCI
- 2.84
- 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: On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications. https://app.cochat.ai/papers/10.1145/1089242.1089247
- The paper
- Pohst, M. (1981). On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications. ACM SIGSAM Bulletin. https://doi.org/10.1145/1089242.1089247
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.