activity
20012026
most citedComplexity and algorithms for computing Voronoi cells of lattices

44 citations · 182 across the 28 of their papers we have counts for

collaborators
Showing math.MGShow all

12 papers · 1 filter

math.MG2026

A non-lattice periodic point set beating the optimal lattice packing-covering constant in dimension five

Sven Ahrend, Mathieu Dutour Sikirić

The packing-covering constant of a point set is , the covering radius divided by the packing radius. Among lattices, its minimum is k…

math.MG2015

The joint weight enumerator of an LCD code and its dual

Adel Alahmadi, Michel Deza, Mathieu Dutour Sikirić +1

A binary linear code is called {\em LCD} if it intersects its dual trivially. We show that the coefficients of the joint weight enumerator of such a code with its dual satisfy line…

math.MG2015★ 4 cited

Hypercube emulation of interconnection networks topologies

Adel Alahmadi, Husain Alhazmi, Shakir Ali +3

We address various topologies (de Bruijn, chordal ring, generalized Petersen, meshes) in various ways ( isometric embedding, embedding up to scale, embedding up to a distance) in a…

math.MG2015

The seven dimensional perfect Delaunay polytopes and Delaunay simplices

Mathieu Dutour Sikiric

For a lattice of , a sphere of center and radius is called {\em empty} if for any we have . Then the set …

math.MG2014

New results on torus cube packings and tilings

Mathieu Dutour Sikirić, Yoshiaki Itoh

We consider sequential random packing of integral translate of cubes into the torus . Two special cases are of special interest: (i) The case which cor…

math.MG2013

Voronoi Polytopes for Polyhedral Norms on Lattices

Michel Deza, Mathieu Dutour Sikirić

A polyhedral norm is a norm N on R^n for which the set N(x)\leq 1 is a polytope. This covers the case of the L^1 and L^{\infty} norms. We consider here effective algorithms for det…