On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis

DOI10.1109/18.651011zbMath1053.94517OpenAlexW2119458444MaRDI QIDQ4392443

Amir K. Khandani, Amir H. Banihashemi

Publication date: 1998

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.651011

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Decoding (94B35)

Related Items (10)

Well-rounded twists of ideal lattices from imaginary quadratic fields ⋮ Bounds for solid angles of lattices of rank three ⋮ Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation ⋮ Revisiting the hexagonal lattice: on optimal lattice circle packing ⋮ On the geometry of cyclic lattices ⋮ Well-rounded zeta-function of planar arithmetic lattices ⋮ On well-rounded sublattices of the hexagonal lattice ⋮ On integral well-rounded lattices in the plane ⋮ Parallel Cholesky-based reduction for the weighted integer least squares problem ⋮ ON WELL-ROUNDED IDEAL LATTICES

This page was built for publication: On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis