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 条
12345