Optimal conflict-avoiding codes of length n equivalent to 0 (mod 16) and weight 3
| dc.citation.epage | 291 | en_US |
| dc.citation.issue | 3 | en_US |
| dc.citation.spage | 275 | en_US |
| dc.citation.volume | 52 | en_US |
| dc.citation.woscount | 16 | |
| dc.contributor.author | Mishima, Miwako | en_US |
| dc.contributor.author | Fu, Hung-Lin | en_US |
| dc.contributor.author | Uruno, Shoichi | en_US |
| dc.contributor.department | 應用數學系 | zh_TW |
| dc.contributor.department | Department of Applied Mathematics | en_US |
| dc.date.accessioned | 2014-12-08T15:08:46Z | |
| dc.date.available | 2014-12-08T15:08:46Z | |
| dc.date.issued | 2009-09-01 | en_US |
| dc.description.abstract | A conflict-avoiding code of length n and weight k is defined as a set C subset of {0, 1}(n) of binary vectors, called codewords, all of Hamming weight k such that the distance of arbitrary cyclic shifts of two distinct codewords in C is at least 2k - 2. In this paper, we obtain direct constructions for optimal conflict-avoiding codes of length n = 16m and weight 3 for any m by utilizing Skolem type sequences. We also show that for the case n = 16m + 8 Skolem type sequences can give more concise constructions than the ones obtained earlier by Jimbo et al. | en_US |
| dc.identifier.doi | 10.1007/s10623-009-9282-2 | 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-009-9282-2 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/6711 | |
| dc.identifier.wosnumber | WOS:000266007400003 | |
| dc.language.iso | en_US | en_US |
| dc.subject | Conflict-avoiding codes | en_US |
| dc.subject | Extended Langford sequences | en_US |
| dc.subject | Extended Skolem sequences | en_US |
| dc.subject | Near-Skolem sequences | en_US |
| dc.title | Optimal conflict-avoiding codes of length n equivalent to 0 (mod 16) and weight 3 | en_US |
| dc.type | Article | en_US |