Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Coxeter, H. S. M.
Few, L.
and
Rogers, C. A.
1959.
Covering space with equal spheres.
Mathematika,
Vol. 6,
Issue. 2,
p.
147.
Bleicher, M. N.
1962.
Lattice Coverings ofn-Space By Spheres.
Canadian Journal of Mathematics,
Vol. 14,
Issue. ,
p.
632.
1969.
Geometry of Numbers.
p.
471.
Baranovskii, E. P.
1971.
Progress in Mathematics.
p.
209.
Gruber, Peter M.
1979.
Contributions to Geometry.
p.
186.
Tóth, G. Fejes
1983.
Convexity and Its Applications.
p.
318.
Gritzmann, Peter
1985.
Lattice covering of space with symmetric convex bodies.
Mathematika,
Vol. 32,
Issue. 2,
p.
311.
1987.
Geometry of Numbers.
Vol. 37,
Issue. ,
p.
632.
Barron, A.R.
and
Cover, T.M.
1991.
Minimum complexity density estimation.
IEEE Transactions on Information Theory,
Vol. 37,
Issue. 4,
p.
1034.
TÖTH, Gábor FEJES
and
KUPERBERG, Wlodzimierz
1993.
Handbook of Convex Geometry.
p.
799.
GRITZMANN, Peter
and
WILLS, Jörg M.
1993.
Handbook of Convex Geometry.
p.
861.
1995.
Combinatorial Geometry.
p.
319.
Rogers, C. A.
and
Zong, C.
1997.
Covering convex bodies by translates of convex bodies.
Mathematika,
Vol. 44,
Issue. 1,
p.
215.
Zong, Chuanming
2002.
From deep holes to free planes.
Bulletin of the American Mathematical Society,
Vol. 39,
Issue. 4,
p.
533.
Dougherty, Randall
and
Faber, Vance
2004.
The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case.
SIAM Journal on Discrete Mathematics,
Vol. 17,
Issue. 3,
p.
478.
Erez, U.
Litsyn, S.
and
Zamir, R.
2005.
Lattices Which Are Good for (Almost) Everything.
IEEE Transactions on Information Theory,
Vol. 51,
Issue. 10,
p.
3401.
Nguyen, Phong Q.
and
Vidick, Thomas
2008.
Sieve algorithms for the shortest vector problem are practical.
Journal of Mathematical Cryptology,
Vol. 2,
Issue. 2,
Gábor, Fejes Tóth
2009.
A Note on Covering by Convex Bodies.
Canadian Mathematical Bulletin,
Vol. 52,
Issue. 3,
p.
361.
Zamir, R.
2009.
Lattices are everywhere.
p.
392.
Nazer, Bobak
and
Gastpar, Michael
2011.
Compute-and-Forward: Harnessing Interference Through Structured Codes.
IEEE Transactions on Information Theory,
Vol. 57,
Issue. 10,
p.
6463.