NEW LOWER BOUNDS FOR ASYMMETRIC AND UNIDIRECTIONAL CODES

被引：14
|
作者：
ETZION, T
机构：
[1] Computer Science Department, The Technion —Israel Institute of Technology, Haifa
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1991年 / 37卷 / 06期
关键词：
ASYMMETRIC CODES; COMBINING CODES; CONSTANT WEIGHT CODES; GOLAY CODE; PARTITIONS; SHORTENING CODES; UNIDIRECTIONAL CODES;
D O I：
10.1109/18.104336
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
New lower bounds on the sizes of asymmetric codes and unidirectional codes are presented. Various methods are used, three of them of special interest. The first is the partitioning method that is a modification of a method used to construct constant weight codes. The second is the combining codes method that is used to obtain a new code from a few others. The third method is shortening by weights that is applied on symmetric codes or on codes generated by the combining codes method. Tables for the sizes of codes of length n less-than-or-equal-to 23 are presented.
引用
收藏
页码：1696 / 1705
页数：10
相关论文
共 50 条
12345