Partially user-irrepressible sequence sets and conflict-avoiding codes
Yuan-Hsun Lo, Wing Shing Wong, Hung-Lin Fu
TL;DR
This paper introduces a partial shift variant of user-irrepressible sequence sets and conflict-avoiding codes, using disjoint difference sets to construct shorter sequences than previously known, advancing the design of conflict-avoidance schemes.
Contribution
It presents a novel partial shift approach and constructs shorter user-irrepressible sequence sets using disjoint difference sets, expanding the theoretical framework.
Findings
Infinite families of shorter user-irrepressible sequence sets are constructed.
New partially conflict-avoiding codes are defined and analyzed.
The approach improves sequence length bounds compared to existing results.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.