Optimal conflict-avoiding codes of odd length and weight three
| dc.citation.epage | 309 | en_US |
| dc.citation.issue | 2 | en_US |
| dc.citation.spage | 289 | en_US |
| dc.citation.volume | 72 | en_US |
| dc.citation.woscount | 1 | |
| dc.contributor.author | Fu, Hung-Lin | en_US |
| dc.contributor.author | Lo, Yuan-Hsun | en_US |
| dc.contributor.author | Shum, Kenneth W. | en_US |
| dc.contributor.department | 應用數學系 | zh_TW |
| dc.contributor.department | Department of Applied Mathematics | en_US |
| dc.date.accessioned | 2014-12-08T15:36:01Z | |
| dc.date.available | 2014-12-08T15:36:01Z | |
| dc.date.issued | 2014-08-01 | en_US |
| dc.description.abstract | A conflict-avoiding code (CAC) of length n and weight k is a collection of k-subsets of such that for any , , where . Let CAC(n, k) denote the class of all CACs of length n and weight k. A CAC with maximum size is called optimal. In this paper, we study the constructions of optimal CACs for the case when n is odd and k = 3. | en_US |
| dc.identifier.doi | 10.1007/s10623-012-9764-5 | 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-012-9764-5 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/24383 | |
| dc.identifier.wosnumber | WOS:000336444600007 | |
| dc.language.iso | en_US | en_US |
| dc.subject | Conflict-avoiding code | en_US |
| dc.subject | Tight equi-difference conflict-avoiding code | en_US |
| dc.subject | Optimal code with weight 3 | en_US |
| dc.title | Optimal conflict-avoiding codes of odd length and weight three | en_US |
| dc.type | Article | en_US |