Title

Weighted Coverings and Packings

Author(s)/Creator(s)

G. D. Cohen
Iiro Honkala
S. N. Litsyn
H. F. Mattson Jr

Document Type

Report

Date

2-1995

Keywords

Combinatorial codes, Coverings, Perfect codes, Constructions of codes.

Language

English

Disciplines

Computer Sciences

Description/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. We study the existence of perfect weighted codes, discuss connections between weighted coverings and packings, and present many constructions for them.

Additional Information

School of Computer and Information Science, Syracuse University, SU-CIS-95-01

Authors later published: Cohen, G., Honkala, I., Litsyn, S. N., & Mattson, H. F. (1995). Weighted coverings and packings. IEEE Transactions on Information Theory, 41(6), 1856-1867. Institute of Electrical and Electronics Engineers. doi:10.1109/18.476311.

Recommended Citation

Cohen, G. D.; Honkala, Iiro; Litsyn, S. N.; and Mattson, H. F. Jr, "Weighted Coverings and Packings" (1995). Electrical Engineering and Computer Science - Technical Reports. 140.
https://surface.syr.edu/eecs_techreports/140

Source

local