Partially user-irrepressible sequence sets and conflict-avoiding codes
| dc.citation.epage | 691 | en_US |
| dc.citation.issue | 3 | en_US |
| dc.citation.spage | 679 | en_US |
| dc.citation.volume | 78 | en_US |
| dc.contributor.author | Lo, Yuan-Hsun | en_US |
| dc.contributor.author | Wong, Wing Shing | en_US |
| dc.contributor.author | Fu, Hung-Lin | en_US |
| dc.contributor.department | 應用數學系 | zh_TW |
| dc.contributor.department | Department of Applied Mathematics | en_US |
| dc.date.accessioned | 2017-04-21T06:55:55Z | |
| dc.date.available | 2017-04-21T06:55:55Z | |
| dc.date.issued | 2016-03 | en_US |
| dc.description.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. | en_US |
| dc.identifier.doi | 10.1007/s10623-014-0024-8 | en_US |
| dc.identifier.issn | 0925-1022 | en_US |
| dc.identifier.journal | DESIGNS CODES AND CRYPTOGRAPHY | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1007/s10623-014-0024-8 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/134246 | |
| dc.identifier.wosnumber | WOS:000370138400006 | en_US |
| dc.language.iso | en_US | en_US |
| dc.subject | User-irrepressible protocol sequence | en_US |
| dc.subject | Conflict-avoiding code | en_US |
| dc.subject | Disjoint difference set | en_US |
| dc.title | Partially user-irrepressible sequence sets and conflict-avoiding codes | en_US |
Files
License bundle
1 - 1 of 1
Loading...
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed to upon submission
- Description: