Optimal strongly conflict-avoiding codes of even length and weight three

被引：0
|
作者：
Yijin Zhang
Yuan-Hsun Lo
Wing Shing Wong
机构：
[1] Nanjing University of Science and Technology,School of Electronic and Optical Engineering
[2] National Taiwan Normal University,Department of Mathematics
[3] The Chinese University of Hong Kong,Department of Information Engineering
来源：
Designs, Codes and Cryptography | 2016年 / 79卷
关键词：
Strongly conflict-avoiding code; Conflict-avoiding code; Protocol sequence; 94B25; 94C30; 11A15;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Strongly conflict-avoiding codes (SCACs) are employed in a slot-asynchronous multiple-access collision channel without feedback to guarantee that each active user can send at least one packet successfully in the worst case within a fixed period of time. By the assumption that all users are assigned distinct codewords, the number of codewords in an SCAC is equal to the number of potential users that can be supported. SCACs have different combinatorial structure compared with conflict-avoiding codes (CACs) due to additional collisions incurred by partially overlapped transmissions. In this paper, we establish upper bounds on the size of SCACs of even length and weight three. Furthermore, it is shown that some optimal CACs can be used to construct optimal SCACs of weight three.
引用
收藏
页码：367 / 382
页数：15
相关论文
共 50 条
  • [11] Classification of Strongly Conflict-Avoiding Codes
    Baicheva, Tsonka Stefanova
    Topalova, Svetlana Todorova
    IEEE COMMUNICATIONS LETTERS, 2018, 22 (12) : 2415 - 2418
  • [12] Optimal conflict-avoiding codes for three active users
    Levenshtein, VI
    Tonchev, VD
    2005 IEEE International Symposium on Information Theory (ISIT), Vols 1 and 2, 2005, : 535 - 537
  • [13] Optimal conflict-avoiding codes of length n ≡ 0 (mod 16) and weight 3
    Miwako Mishima
    Hung-Lin Fu
    Shoichi Uruno
    Designs, Codes and Cryptography, 2009, 52 : 275 - 291
  • [14] Optimal conflict-avoiding codes of length n ≡ 0 (mod 16) and weight 3
    Mishima, Miwako
    Fu, Hung-Lin
    Uruno, Shoichi
    DESIGNS CODES AND CRYPTOGRAPHY, 2009, 52 (03) : 275 - 291
  • [15] Bounds and constructions for optimal constant weight conflict-avoiding codes
    Momihara, Koji
    Mueller, Meinard
    Satoh, Junya
    Jimbo, Masakazu
    2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 336 - +
  • [16] Constant weight conflict-avoiding codes
    Momihara, Koji
    Mueller, Meinard
    Satoh, Junya
    Jimbo, Masakazu
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2007, 21 (04) : 959 - 979
  • [17] Optimal equi-difference conflict-avoiding codes of weight four
    Lin, Yiling
    Mishima, Miwako
    Jimbo, Masakazu
    DESIGNS CODES AND CRYPTOGRAPHY, 2016, 78 (03) : 747 - 776
  • [18] Optimal equi-difference conflict-avoiding codes of weight four
    Yiling Lin
    Miwako Mishima
    Masakazu Jimbo
    Designs, Codes and Cryptography, 2016, 78 : 747 - 776
  • [19] A new series of optimal tight conflict-avoiding codes
    Mishima, Miwako
    Momihara, Koji
    DISCRETE MATHEMATICS, 2017, 340 (04) : 617 - 629
  • [20] New Results on Optimal Multichannel Conflict-Avoiding Codes
    Lo, Yuan-Hsun
    Gu, Wen-Wen
    Zhang, Yijin
    2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 3086 - 3091
12345