论文标题
避免冲突的多通道的权重代码三和四
Multichannel Conflict-Avoiding Codes of Weights Three and Four
论文作者
论文摘要
Levenshtein引入了避免冲突的代码（CACS），作为无反馈的多通道碰撞通道的单渠道传输方案。当同时活动源节点的数量小于或等于CAC的重量时，无论源节点之间的相对时间偏移何在，每个活动源节点在固定的时间持续时间内成功地传输至少一个数据包。在本文中，我们将CAC扩展到多通道CAC，以在多个正交通道上提供如此艰难的保证。得出了三个和四个权重的多通道CAC的代码字数的上限，并且呈现相对于这些边界最佳的构造。
Conflict-avoiding codes (CACs) were introduced by Levenshtein as a single-channel transmission scheme for a multiple-access collision channel without feedback. When the number of simultaneously active source nodes is less than or equal to the weight of a CAC, it is able to provide a hard guarantee that each active source node transmits at least one packet successfully within a fixed time duration, no matter what the relative time offsets between the source nodes are. In this paper, we extend CACs to multichannel CACs for providing such a hard guarantee over multiple orthogonal channels. Upper bounds on the number of codewords for multichannel CACs of weights three and four are derived, and constructions that are optimal with respect to these bounds are presented.
