Title: Optimal conflict-avoiding codes of length n equivalent to 0 (mod 16) and weight 3
Authors: Mishima, Miwako
Fu, Hung-Lin
Uruno, Shoichi
Department of Applied Mathematics
Keywords: Conflict-avoiding codes;Extended Langford sequences;Extended Skolem sequences;Near-Skolem sequences
Issue Date: 1-Sep-2009
Abstract: A conflict-avoiding code of length n and weight k is defined as a set C subset of {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.
URI: http://dx.doi.org/10.1007/s10623-009-9282-2
ISSN: 0925-1022
DOI: 10.1007/s10623-009-9282-2
Volume: 52
Issue: 3
Begin Page: 275
End Page: 291
Appears in Collections:Articles

Files in This Item:

  1. 000266007400003.pdf