Document Type

Report

Date

2-1995

Embargo Period

5-4-2012

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.

Source

local

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.