On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis
From MaRDI portal
Publication:4392443
DOI10.1109/18.651011zbMath1053.94517MaRDI 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
Related Items
Well-rounded twists of ideal lattices from imaginary quadratic fields, Well-rounded zeta-function of planar arithmetic lattices, On the geometry of cyclic lattices, Bounds for solid angles of lattices of rank three, Revisiting the hexagonal lattice: on optimal lattice circle packing, 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, Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation