Partially user-irrepressible sequence sets and conflict-avoiding codes
arXiv:1412.6133 · doi:10.1007/s10623-014-0024-8
Abstract
In this paper we give a partial shift version of user-irrepressible sequence sets and conflict-avoiding codes. By means of disjoint difference sets, we obtain an infinite number of such user-irrepressible sequence sets whose lengths are shorter than known results in general. Subsequently, the newly defined partially conflict-avoiding codes are discussed.
13 pages, 4 figures, 3 tables. Published in Designs, Codes and Cryptography