Simultaneous packing and covering in sequence spaces
Swanepoel, K.
(2009).
Simultaneous packing and covering in sequence spaces.
Discrete and Computational Geometry,
42(2), 335-340.
https://doi.org/10.1007/s00454-009-9189-8
(2009).
Simultaneous packing and covering in sequence spaces.
Discrete and Computational Geometry,
42(2), 335-340.
https://doi.org/10.1007/s00454-009-9189-8
We adapt a construction of Klee (1981) to find a packing of unit balls in ℓ p (1≤p<∞) which is efficient in the sense that enlarging the radius of each ball to any R>21−1/p covers the whole space. We show that the value 21−1/p is optimal.