等重码长度的一个广义上界
A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes
摘要：
在无反馈的多址冲突信道中使用了避错码。冲突避免码中的码字的数量是系统中可以支持的潜在用户的数量。本文证明了一个新的冲突避免码长度上界。这个上界是通用的，因为它适用于所有码长和所有汉明重量。几个现有的冲突避免码，这是已知的最佳汉明重量等于4和5，是最佳的所有汉明重量一般的建设。
英文摘要：
Conflict-avoiding codes are used in the multiple-access collision channel without feedback. The number of codewords in a conflict-avoiding code is the number of potential users that can be supported in the system. In this paper, a new upper bound on the size of conflict-avoiding codes is proved. This upper bound is general in the sense that it is applicable to all code lengths and all Hamming weights. Several existing constructions for conflict-avoiding codes, which are known to be optimal for Hamming weights equal to four and five, are shown to be optimal for all Hamming weights in general.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
