Partially user-irrepressible sequence sets and conflict-avoiding codes

DOI10.1007/S10623-014-0024-8MaRDI QIDQ256572zbMATH OpenOpenAlexFDO

Authors Yuan-Hsun Lo, Wing Shing Wong, Hung-Lin Fu

Publication date 9 March 2016

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1412.6133

zbMATH Keywords

conflict-avoiding codedisjoint difference setuser-irrepressible protocol sequence

Mathematics Subject Classification ID

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Combinatorial codes (94B25) Applications of graph theory to circuits and networks (94C15)

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.

Recommendations

• User-irrepressible sequences
• On Conflict-Avoiding Codes of Length $n=4m$ for Three Active Users
• Some constructions of conflict-avoiding codes
• Optimal conflict-avoiding codes for three, four and five active users
• A tight asymptotic bound on the size of constant-weight conflict-avoiding codes

Cites work

• scientific article; zbMATH DE number 3103352 (Why is no real title available?)
• A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes
• A Recursive Construction For Regular Difference Triangle Sets
• A Theorem in Finite Projective Geometry and Some Applications to Number Theory
• Constant Weight Conflict-Avoiding Codes
• Constructions for difference triangle sets
• Difference triangle sets from affine planes
• Disjoint difference sets, difference triangle sets, and related codes
• Existence of (q, 7, 1) difference families with q a prime power
• Existence of (q,k, 1) difference families withq a prime power andk = 4, 5
• Existence of \((q,6,1)\) difference families with \(q\) a prime power
• Further results on difference triangle sets
• New Protocol Sequences for Random-Access Channels Without Feedback
• On certain distributions of integers in pairs with given differences
• Optimal Conflict-Avoiding Codes of Even Length and Weight 3
• Optimal conflict-avoiding codes of odd length and weight three
• Recursive constructions for cyclic block designs
• The collision channel without feedback
• Verification of a Conjecture of Th. Skolem.

Cited in

(1)

• User-irrepressible sequences

This page was built for publication: Partially user-irrepressible sequence sets and conflict-avoiding codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q256572)