A new series of optimal tight conflict-avoiding codes of weight 3

In this article, a construction of an optimal tight conflict-avoiding code of length 3dpe and weight 3 is shown for d≡1(mod3), e∈N and a prime p≡3(mod8) with p≠3, assuming that p is a non-Wieferich prime if e≥2. This is a new series of optimal conflict-avoiding code for which the number of codewords can be exactly determined.