Covering Codes

By G. Cohen, I. Honkala, Simon Litsyn, A. Lobstein. North-Holland Mathematical Library, 2005

532 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

On sizes of complete caps in projective spaces PG(n, q) and arcs in planes PG(2, q) (2009, background): “For an introduction to coverings of vector spaces over finite fields and the concept of the code covering radius, see [16,74].”
Geometry of the Restricted Boltzmann Machine (2009, background): “There are two quantities from the coding theory literature [2, 5, 6, 18] that are of interest to us.”
Lattices which are good for (almost) everything (2003, background): “This corresponds to covering codes, see e.g., [2].”
Matrix embedding for large payloads (2006, methodology): “2 in [2] and holds for any l < n=2 for sufficiently large n (e.”
Computer search in projective planes for the sizes of complete arcs (2005, background): “For information on the covering radius of a code, see [2].”