A conflict-avoiding code of length n and weight k is defined as a set C ⊆ {0, 1} n of binary vectors, called codewords, all of Hamming weight k such that the distance of arbitrary cyclic shifts of two distinct codewords in C is at least 2k − 2. In this paper, we obtain direct constructions for optimal conflict-avoiding codes of length n = 16m and weight 3 for any m by utilizing Skolem type sequences. We also show that for the case n = 16m + 8 Skolem type sequences can give more concise constructions than the ones obtained earlier by Jimbo et al.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.