Partially user-irrepressible sequence sets and conflict-avoiding codes
Information Theory
2016-05-17 v2 Combinatorics
math.IT
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.
Keywords
Cite
@article{arxiv.1412.6133,
title = {Partially user-irrepressible sequence sets and conflict-avoiding codes},
author = {Yuan-Hsun Lo and Wing Shing Wong and Hung-Lin Fu},
journal= {arXiv preprint arXiv:1412.6133},
year = {2016}
}
Comments
13 pages, 4 figures, 3 tables. Published in Designs, Codes and Cryptography