Bounds on the rate of separating codes

被引：0
|
作者：
I. V. Vorob’ev
机构：
[1] Faculty of Mechanics and Mathematics,Probability Theory Chair
[2] Lomonosov Moscow State University,undefined
来源：
Problems of Information Transmission | 2017年 / 53卷
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
A code with words in a finite alphabet is said to be an (s, l) separating code if for any two disjoint collections of its words of size at most s and l, respectively, there exists a coordinate in which the set of symbols of the first collection do not intersect the set of symbols of the second. The main goal of the paper is obtaining new bounds on the rate of (s, l) separating codes. Bounds on the rate of binary (s, l) separating codes, the most important for applications, are studied in more detail. We give tables of numerical values of the best presently known bounds on the rate.
引用
收藏
页码：30 / 41
页数：11
相关论文
共 50 条
  • [1] Bounds on the Rate of Separating Codes
    Vorob'ev, I. V.
    [J]. PROBLEMS OF INFORMATION TRANSMISSION, 2017, 53 (01) : 30 - 41
  • [2] Improved Upper Bounds for the Rate of Separating and Completely Separating Codes
    Vorob'ev, I. V.
    Lebedev, V. S.
    [J]. PROBLEMS OF INFORMATION TRANSMISSION, 2022, 58 (03) : 242 - 253
  • [3] Improved Upper Bounds for the Rate of Separating and Completely Separating Codes
    I. V. Vorob’ev
    V. S. Lebedev
    [J]. Problems of Information Transmission, 2022, 58 : 242 - 253
  • [4] Upper bounds on separating codes
    Cohen, GD
    Schaathun, HG
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (06) : 1291 - 1295
  • [5] Separating codes: Constructions and bounds
    Cohen, G
    Schaathun, HG
    [J]. LATIN 2004: THEORETICAL INFORMATICS, 2004, 2976 : 322 - 328
  • [6] New upper bounds on separating codes
    Cohen, G
    Schaathun, HG
    [J]. ICT'2003: 10TH INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS, VOLS I AND II, CONFERENCE PROCEEDINGS, 2003, : 1290 - 1293
  • [7] Bounds on Separating Redundancy of Linear Codes and Rates of X-Codes
    Tsunoda, Yu
    Fujiwara, Yuichiro
    Ando, Hana
    Vandendriessche, Peter
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (12) : 7577 - 7593
  • [8] Bounds on the rate of superimposed codes
    D'yachkov, A. G.
    Vorobyev, I. V.
    Polyanskii, N. A.
    Shchukin, V. Yu.
    [J]. 2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 2341 - 2345
  • [9] Bounds on the rate of disjunctive codes
    A. G. D’yachkov
    I. V. Vorob’ev
    N. A. Polyansky
    V. Yu. Shchukin
    [J]. Problems of Information Transmission, 2014, 50 : 27 - 56
  • [10] Bounds on the Rate of Disjunctive Codes
    D'yachkov, A. G.
    Vorob'ev, I. V.
    Polyansky, N. A.
    Shchukin, V. Yu.
    [J]. PROBLEMS OF INFORMATION TRANSMISSION, 2014, 50 (01) : 27 - 56
12345