1. You are Here：

Full metadata record
DC FieldValueLanguage
dc.contributor.authorLo, Yuan-Hsunen_US
dc.contributor.authorWong, Wing Shingen_US
dc.contributor.authorFu, Hung-Linen_US
dc.date.accessioned2017-04-21T06:55:55Z-
dc.date.available2017-04-21T06:55:55Z-
dc.date.issued2016-03en_US
dc.identifier.issn0925-1022en_US
dc.identifier.urihttp://dx.doi.org/10.1007/s10623-014-0024-8en_US
dc.identifier.urihttp://hdl.handle.net/11536/134246-
dc.description.abstractIn 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.en_US
dc.language.isoen_USen_US
dc.subjectUser-irrepressible protocol sequenceen_US
dc.subjectConflict-avoiding codeen_US
dc.subjectDisjoint difference seten_US
dc.titlePartially user-irrepressible sequence sets and conflict-avoiding codesen_US
dc.identifier.doi10.1007/s10623-014-0024-8en_US
dc.identifier.journalDESIGNS CODES AND CRYPTOGRAPHYen_US
dc.citation.volume78en_US
dc.citation.issue3en_US
dc.citation.spage679en_US
dc.citation.epage691en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:000370138400006en_US
Appears in Collections:Articles


Related Contents
Loading...