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 条
  • [1] NEW LOWER BOUNDS FOR BINARY-CODES OF ASYMMETRIC DISTANCE 2
    ZHANG, Z
    XIA, XG
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1992, 38 (05) : 1592 - 1597
  • [2] New lower bounds and constructions for binary codes correcting asymmetric errors
    Fu, FW
    Ling, S
    Xing, CP
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (12) : 3294 - 3299
  • [3] NEW LOWER BOUNDS FOR COVERING CODES
    HOU, XD
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (04) : 895 - 899
  • [4] New lower bounds for covering codes
    Habsieger, L
    Plagne, A
    DISCRETE MATHEMATICS, 2000, 222 (1-3) : 125 - 149
  • [5] New lower bounds for covering codes
    Habsieger, L.
    Plagne, A.
    Xibei Gongye Daxue Xuebao/Journal of Northwestern Polytechnical University, 1999, 17 (03): : 125 - 149
  • [6] NEW LOWER BOUNDS FOR BINARY COVERING CODES
    LI, DF
    CHEN, W
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (04) : 1122 - 1129
  • [7] NEW LOWER BOUNDS FOR CONSTANT WEIGHT CODES
    VANPUL, CLM
    ETZION, T
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1989, 35 (06) : 1324 - 1329
  • [8] New Lower Bounds for Constant Dimension Codes
    Silberstein, Natalia
    Trautmann, Anna-Lena
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 514 - +
  • [9] New lower and upper bounds on Armstrong codes
    Alexandrova, Todorka
    Boyvalenkov, Peter
    Sali, Attila
    PROCEEDINGS OF THE 2020 SEVENTEENTH INTERNATIONAL WORKSHOP ON ALGEBRAIC AND COMBINATORIAL CODING THEORY ALGEBRAIC AND COMBINATORIAL CODING THEORY (ACCT 2020): PROCEEDINGS OF THE SEVENTEENTH INTERNATIONAL WORKSHOP ON ALGEBRAIC AND COMBINATORIAL CODING THEORY ACCT 2020, 2020, : 1 - 5
  • [10] Asymmetric Lee Distance Codes: New Bounds and Constructions
    Gabrys, Ryan
    Kiah, Han Mao
    Milenkovic, Olgica
    2015 IEEE INFORMATION THEORY WORKSHOP (ITW), 2015,
12345