1. You are Here：

Full metadata record
DC FieldValueLanguage
dc.contributor.authorKlove, Torleiven_US
dc.contributor.authorLin, Te-Tsungen_US
dc.contributor.authorTsai, Shi-Chunen_US
dc.contributor.authorTzeng, Wen-Gueyen_US
dc.date.accessioned2014-12-08T15:06:45Z-
dc.date.available2014-12-08T15:06:45Z-
dc.date.issued2010-06-01en_US
dc.identifier.issn0018-9448en_US
dc.identifier.urihttp://dx.doi.org/10.1109/TIT.2010.2046212en_US
dc.identifier.urihttp://hdl.handle.net/11536/5300-
dc.description.abstractAn (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.language.isoen_USen_US
dc.subjectBoundsen_US
dc.subjectChebyshev distanceen_US
dc.subjectcode constructionsen_US
dc.subjectflash memoryen_US
dc.subjectpermutation arraysen_US
dc.titlePermutation Arrays Under the Chebyshev Distanceen_US
dc.typeArticleen_US
dc.identifier.doi10.1109/TIT.2010.2046212en_US
dc.identifier.journalIEEE TRANSACTIONS ON INFORMATION THEORYen_US
dc.citation.volume56en_US
dc.citation.issue6en_US
dc.citation.spage2611en_US
dc.citation.epage2617en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000277880200010-
dc.citation.woscount20-
Appears in Collections:Articles


Files in This Item:

  1. 000277880200010.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.

Related Contents
Loading...