Covering the Hamming Space with Sets Translated by Vectors of a Linear Code

We establish an asymptotically exact bound on the cardinality of a linear code which, together with its cosets with representatives from a given set, forms a covering of the Hamming space.