Weighted Coverings and Packings

Gérard Cohen, Iiro Honkala, Simon N. Litsyn, H. F. Mattson

Research output: Contribution to journalArticlepeer-review


In this paper we introduce a generalization of the concepts of coverings and packings in Hamming space called weighted coverings and packings. This allows us to formulate a number of well-known coding theoretical problems in a uniform manner. We study the existence of perfect weighted codes, discuss connections between weighted coverings and packings, and present many constructions for them.

Original languageEnglish
Pages (from-to)1856-1867
Number of pages12
JournalIEEE Transactions on Information Theory
Issue number6
StatePublished - Nov 1995


  • Combinatorial codes
  • constructions of codes
  • coverings
  • perfect codes


Dive into the research topics of 'Weighted Coverings and Packings'. Together they form a unique fingerprint.

Cite this