多信道三重和四重避盲码
Multichannel Conflict-Avoiding Codes of Weights Three and Four
摘要：
避免冲突码（CAC）是Levenshtein提出的一种用于多址冲突信道的无反馈单信道传输方案。当同时活动的源节点的数量小于或等于CAC的权重时，无论源节点之间的相对时间偏移如何，都能够提供每个活动源节点在固定持续时间内成功发送至少一个分组的硬保证。在本文中，我们将CAC扩展到多通道CAC，以在多个正交通道上提供这样的硬保证。上界的码字的数量为多通道CAC的权重3和4的推导，并提出了这些界限的最佳结构。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
