等重等差避免冲突码的一个新的上界和最优构造
A new upper bound and optimal constructions of equi-difference conflict-avoiding codes on constant weight
摘要：
在无反馈的多址冲突信道中使用了避错码（CAC）。CAC的大小是系统中可以支持的潜在用户的数量。具有最大长度的代码称为最优代码。最佳CAC的使用使得尽可能多的异步用户能够高效可靠地传输信息。本文给出了任意等差CAC的最大尺寸的一个新的上界。此外，还给出了等差CAC的三种最优构造。其中一个是素数长度$L=p$的广义构造，另外两个是二素数长度$L=pq$的广义构造.
英文摘要：
Conflict-avoiding codes (CACs) have been used in multiple-access collision channel without feedback. The size of a CAC is the number of potential users that can be supported in the system. A code with maximum size is called optimal. The use of an optimal CAC enables the largest possible number of asynchronous users to transmit information efficiently and reliably. In this paper, a new upper bound on the maximum size of arbitrary equi-difference CAC is presented. Furthermore, three optimal constructions of equi-difference CACs are also given. One is a generalized construction for prime length $L=p$ and the other two are for two-prime length $L=pq$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
