Partially user-irrepressible sequence sets and conflict-avoiding codes

Yuan Hsun Lo; Wing Shing Wong; Hung-Lin Fu

doi:10.1007/s10623-014-0024-8

Partially user-irrepressible sequence sets and conflict-avoiding codes

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

^*Corresponding author for this work

Department of Applied Mathematics

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

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 language	English
Pages (from-to)	679-691
Number of pages	13
Journal	Designs, Codes, and Cryptography
Volume	78
Issue number	3
DOIs	https://doi.org/10.1007/s10623-014-0024-8
State	Published - 1 Mar 2016

Keywords

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

Access to Document

10.1007/s10623-014-0024-8

Cite this

@article{9e1d0ab22dbe4a12ac63e71c47a82692,

title = "Partially user-irrepressible sequence sets and conflict-avoiding codes",

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 = "Conflict-avoiding code, Disjoint difference set, User-irrepressible protocol sequence",

author = "Lo, {Yuan Hsun} and Wong, {Wing Shing} and Hung-Lin Fu",

note = "Publisher Copyright: {\textcopyright} 2014, Springer Science+Business Media New York.",

year = "2016",

month = mar,

day = "1",

doi = "10.1007/s10623-014-0024-8",

language = "English",

volume = "78",

pages = "679--691",

journal = "Designs, Codes, and Cryptography",

issn = "0925-1022",

publisher = "Springer Netherlands",

number = "3",

}

TY - JOUR

T1 - Partially user-irrepressible sequence sets and conflict-avoiding codes

AU - Lo, Yuan Hsun

AU - Wong, Wing Shing

AU - Fu, Hung-Lin

PY - 2016/3/1

Y1 - 2016/3/1

N2 - 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.

AB - 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.

KW - Conflict-avoiding code

KW - Disjoint difference set

KW - User-irrepressible protocol sequence

UR - http://www.scopus.com/inward/record.url?scp=84958170857&partnerID=8YFLogxK

U2 - 10.1007/s10623-014-0024-8

DO - 10.1007/s10623-014-0024-8

M3 - Article

AN - SCOPUS:84958170857

SN - 0925-1022

VL - 78

SP - 679

EP - 691

JO - Designs, Codes, and Cryptography

JF - Designs, Codes, and Cryptography

IS - 3

ER -

Partially user-irrepressible sequence sets and conflict-avoiding codes

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this