最优冲突回避码的具体构造
Explicit constructions of optimal conflict-avoiding codes

冲突回避码被应用于多分址冲突信道中，目前对最优冲突回避码的具体构造取得的结果大多是码重k=3，4，5，6，7的情况，对码重k>7具体构造结果比较少. 为此，利用已有的构造方法结合数论相关知识，进一步构造码重k=8，9，10，11，12，码长n=(k－1)p时的最优冲突回避码新结果.
Conflict-avoiding code was applied in multiple-access in the collision channel. Previously，researchers investigate explicit constructions of optimal conflict-avoiding code in the case of k=3，4，5，6，7. And there is very few results in the case of k>7. In this paper，combing pre-existing constructions with the related knowledge of number theory，a new infinite classes of optimal conflict-avoiding codes with weight k=8，9，10，11，12 and length n=(k－1)p are obtained