Permutation Arrays Under the Chebyshev Distance
| dc.citation.epage | 2617 | en_US |
| dc.citation.issue | 6 | en_US |
| dc.citation.spage | 2611 | en_US |
| dc.citation.volume | 56 | en_US |
| dc.citation.woscount | 20 | |
| dc.contributor.author | Klove, Torleiv | en_US |
| dc.contributor.author | Lin, Te-Tsung | en_US |
| dc.contributor.author | Tsai, Shi-Chun | en_US |
| dc.contributor.author | Tzeng, Wen-Guey | en_US |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.date.accessioned | 2014-12-08T15:06:45Z | |
| dc.date.available | 2014-12-08T15:06:45Z | |
| dc.date.issued | 2010-06-01 | en_US |
| dc.description.abstract | An (n, d) permutation array (PA) is a subset of S(n) with the property that the distance (under some metric) between any two permutations in the array is at least d. They became popular recently for communication over power lines. Motivated by an application to flash memories, in this paper, the metric used is the Chebyshev metric. A number of different constructions are given, as well as bounds on the size of such PA. | en_US |
| dc.identifier.doi | 10.1109/TIT.2010.2046212 | en_US |
| dc.identifier.issn | 0018-9448 | en_US |
| dc.identifier.journal | IEEE TRANSACTIONS ON INFORMATION THEORY | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1109/TIT.2010.2046212 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/5300 | |
| dc.identifier.wosnumber | WOS:000277880200010 | |
| dc.language.iso | en_US | en_US |
| dc.subject | Bounds | en_US |
| dc.subject | Chebyshev distance | en_US |
| dc.subject | code constructions | en_US |
| dc.subject | flash memory | en_US |
| dc.subject | permutation arrays | en_US |
| dc.title | Permutation Arrays Under the Chebyshev Distance | en_US |
| dc.type | Article | en_US |