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 条
  • [21] Some improved bounds for secure frameproof codes and related separating hash families
    Stinson, Douglas R.
    Zaverucha, Gregory M.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (06) : 2508 - 2514
  • [22] Intersecting codes and separating codes
    Cohnen, G
    Encheva, S
    Litsyn, S
    Schaathun, HG
    [J]. DISCRETE APPLIED MATHEMATICS, 2003, 128 (01) : 75 - 83
  • [23] Improved bounds for the rate loss of multiresolution source codes
    Feng, HY
    Effros, M
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (04) : 809 - 821
  • [24] Bounds on Rates of LDPC Codes for BEC with Varying Erasure Rate
    Barak, Ohad
    Erez, Uri
    Burshtein, David
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2010, 58 (10) : 2835 - 2844
  • [25] Lower bounds on the rate-distortion function of LDGM codes
    Dimakis, A. G.
    Wainwright, M. J.
    Ramchandran, K.
    [J]. 2007 IEEE INFORMATION THEORY WORKSHOP, VOLS 1 AND 2, 2007, : 650 - 655
  • [26] Bounds on Rates of LDPC Codes for BEC with Varying Erasure Rate
    Barak, Ohad
    Erez, Uri
    Burshtein, David
    [J]. 2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 1133 - 1137
  • [27] Bounds on the Size and Asymptotic Rate of Subblock-Constrained Codes
    Tandon, Anshoo
    Kiah, Han Mao
    Motani, Mehul
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (10) : 6604 - 6619
  • [28] Upper bounds on the rate of LDPC codes as a function of minimum distance
    Ben-Haim, Y
    Litsyn, S
    [J]. 2005 IEEE International Symposium on Information Theory (ISIT), Vols 1 and 2, 2005, : 47 - 51
  • [29] Upper bounds on the rate of LDPC codes as a function of minimum distance
    Ben-Haim, Y
    Litsyn, S
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (05) : 2092 - 2100
  • [30] Bounds on the rate of codes which forbid specified difference sequences
    Moision, BE
    Orlitsky, A
    Siegel, PH
    [J]. GLOBECOM'99: SEAMLESS INTERCONNECTION FOR UNIVERSAL SERVICES, VOL 1-5, 1999, : 878 - 882
12345