FURTHER RESULTS ON (K, T)-SUBNORMAL COVERING CODES

被引：9
作者：
OSTERGARD, PRJ
机构：
[1] Digital Systems Laboratory, Helsinki University of Technology
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1992年 / 38卷 / 01期
关键词：
COVERING RADIUS; NORMAL AND SUBNORMAL CODES; Q-ARY CODES;
D O I：
10.1109/18.108275
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The concept of (k, t)-subnormal covering codes, introduced by Honkala, is discussed generalizing some of the earlier results. In a similar way, (k, t)-normal covering codes are defined. Using the results, including some new constructions, upper bounds for covering codes are improved. Finally, it is shown how simulated annealing can be used to find acceptable partitions for codes.
引用
收藏
页码：206 / 210
页数：5
相关论文
共 20 条
12