Partially user-irrepressible sequence sets and conflict-avoiding codes
classification
💻 cs.IT
math.COmath.IT
keywords
setscodesconflict-avoidingsequenceuser-irrepressiblepartiallydefineddifference
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.