Closest point search in lattices
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.
this paper
works it cites
works citing it
node size = global citations · hover for the full title
Citation edge evidence
- Closest point search in lattices→An Introduction to Probability Theory and Its Applications.Legacy edge — source detail unavailable
- Closest point search in lattices→Factoring polynomials with rational coefficientsLegacy edge — source detail unavailable
- Closest point search in lattices→A universal lattice code decoder for fading channelsLegacy edge — source detail unavailable
- Closest point search in lattices→Lattice basis reduction: Improved practical algorithms and solving subset sum problemsLegacy edge — source detail unavailable
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems→Factoring polynomials with rational coefficientsLegacy edge — source detail unavailable
What this paper cites, inside the corpus
Links
Download BibTeX · Download RIS · 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
sha256 88a60cdbb94c6a13…