| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5776941 | Discrete Mathematics | 2017 | 13 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Miwako Mishima, Koji Momihara,