较大码重最优冲突回避码的具体构造

Explicit constructions of optimal conflict-avoiding codes with bigger weight

目前对码重k=3,4,5,6时有一些结果,对码重k>7的最优冲突回避码具体构造取得的结果很少.利用数论二次剩余和欧拉函数的相关知识,进一步具体构造码重为k=8,9,10,11,12,码长为n=(k-1)p^(r),r为正整数时最优冲突回避码的一系列新结果.

Previously,some explicit constructions of optimal conflict-avoiding code with weight k=3,4,5,6,7are obtained.But there is very few results with weight k>7.In this paper,using Euler function and congruent numbers'properties in integer rings,a new infinite classes of optimal conflict-avoiding codes with weight k=8,9,10,11,12 and length n=(k-1)p^(r) are obtained,where r is a positive integer.