A1 Refereed original research article in a scientific journal
Weighted coverings and packings
Authors: Cohen G, Honkala I, Litsyn SN, Mattson HF
Publisher: IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Publication year: 1995
Journal: IEEE Transactions on Information Theory
Journal name in source: IEEE TRANSACTIONS ON INFORMATION THEORY
Journal acronym: IEEE T INFORM THEORY
Volume: 41
Issue: 6
First page : 1856
Last page: 1867
Number of pages: 12
ISSN: 0018-9448
DOI: https://doi.org/10.1109/18.476311(external)
Abstract
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. The study the existence of perfect weighted codes, discuss connections between weighted coverings and packings, and present many constructions for them.
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. The study the existence of perfect weighted codes, discuss connections between weighted coverings and packings, and present many constructions for them.
UTU Research Portal