Weighted coverings and packings

被引：9
|
作者：
Cohen, G
Honkala, I
Litsyn, SN
Mattson, HF
机构：
[1] TURKU UNIV, DEPT MATH, SF-20500 TURKU 50, FINLAND
[2] TEL AVIV UNIV, DEPT ELECT ENGN SYST, IL-69978 RAMAT AVIV, ISRAEL
[3] SYRACUSE UNIV, SCH COMP & INFORMAT SCI, SYRACUSE, NY 13244 USA
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1995年 / 41卷 / 06期
关键词：
combinatorial codes; coverings; perfect codes; constructions of codes;
D O I：
10.1109/18.476311
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页码：1856 / 1867
页数：12
相关论文
共 50 条
12345