Decoding permutation arrays with ternary vectors
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
9 | en_US |
dc.citation.issue |
1 | en_US |
dc.citation.spage |
1 | en_US |
dc.citation.volume |
61 | en_US |
dc.citation.woscount |
2 | |
dc.contributor.author |
Lee, Chia-Jung | en_US |
dc.contributor.author |
Lin, Te-Tsung | en_US |
dc.contributor.author |
Shieh, Min-Zheng | en_US |
dc.contributor.author |
Tsai, Shi-Chun | en_US |
dc.contributor.author |
Wu, Hsin-Lung | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:26:47Z | |
dc.date.available |
2014-12-08T15:26:47Z | |
dc.date.issued |
2011-10-01 | en_US |
dc.description.abstract |
We give an explicit decoding scheme for the permutation arrays under Hamming distance metric, where the encoding is constructed via a distance-preserving mapping from ternary vectors to permutations (3-DPM). | en_US |
dc.identifier.doi |
10.1007/s10623-010-9435-3 | 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-010-9435-3 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/19037 | |
dc.identifier.wosnumber |
WOS:000291746200001 | |
dc.language.iso |
en_US | en_US |
dc.subject |
Permutation array | en_US |
dc.subject |
Ternary code | en_US |
dc.subject |
Decoding | en_US |
dc.subject |
Hamming distance | en_US |
dc.title |
Decoding permutation arrays with ternary vectors | en_US |
dc.type |
Article | en_US |
檔案
- 000291746200001.pdf (400.7 KB, Adobe PDF)
所屬典藏: 期刊論文