Covering radius of two-dimensional lattices

MaRDI QIDQ2858312zbMATH OpenFDO

Authors Yupeng Jiang, Yingpu Deng, Yanbin Pan

Publication date 19 November 2013

Published in Journal of Systems Science and Mathematical Sciences (Search for Journal in Brave)

zbMATH Keywords

covering radiusdeep holeGauss' algorithmtwo-dimensional lattices

Mathematics Subject Classification ID

Lattices and convex bodies (number-theoretic aspects) (11H06) Number-theoretic algorithms; complexity (11Y16) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The complexity of the covering radius problem
• Complexity and algorithms for computing Voronoi cells of lattices
• Computational approaches to lattice packing and covering problems
• The remote set problem on lattices
• On the Lattice Isomorphism Problem

Cited in

(10)

• A note on the distribution of the distance from a lattice
• Even lattices with covering radius \(< \sqrt{2}\)
• A proof of a conjecture by Haviv, Lyubashevsky and Regev on the second moment of a lattice Voronoi cell
• The remote set problem on lattices
• Complexity and algorithms for computing Voronoi cells of lattices
• On approximating the covering radius and finding dense lattice subspaces
• On lattice extensions
• On periodicity of continued fractions with partial quotients in quadratic number fields
• Lattice covering by semicrosses of arm length 2
• Computational approaches to lattice packing and covering problems

This page was built for publication: Covering radius of two-dimensional lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2858312)