Partially user-irrepressible sequence sets and conflict-avoiding codes

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

*Corresponding author for this work

Research output: Contribution to journalArticle

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.

Original languageEnglish
Pages (from-to)679-691
Number of pages13
JournalDesigns, Codes, and Cryptography
Volume78
Issue number3
DOIs
StatePublished - 1 Mar 2016

Keywords

  • Conflict-avoiding code
  • Disjoint difference set
  • User-irrepressible protocol sequence

Fingerprint Dive into the research topics of 'Partially user-irrepressible sequence sets and conflict-avoiding codes'. Together they form a unique fingerprint.

  • Cite this