Optimal equi-difference conflict-avoiding codes of odd length and weight three (Q2637325)

A conflict-avoiding code (CAC) \(C\) is a set of binary words of length \(n\) and Hamming weight \(w\) with the property that the Hamming distance between the cyclic shifts of any two distinct words in \(C\) must be at least \(2w-2\). This definition is close to that of orbit representatives of a cyclic code with length \(n\), constant weight \(w\), and minimum distance \(2w-2\); for a cyclic code it is also required that the Hamming distance between the elements of an orbit be at least \(2w-2\). The authors study the maximum size of CACs with \(w=3\), odd \(n\), and an additional property called equi-difference. An equi-difference code has codewords only of the form \(\{0,i,\ldots ,(w-1)i\}\).