Simple distance-preserving mappings from ternary vectors to permutations
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
3256 | en_US |
dc.citation.issue |
7 | en_US |
dc.citation.spage |
3251 | en_US |
dc.citation.volume |
54 | en_US |
dc.citation.woscount |
3 | |
dc.contributor.author |
Lin, Te-Tsung | en_US |
dc.contributor.author |
Tsai, Shi-Chum | 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:11:13Z | |
dc.date.available |
2014-12-08T15:11:13Z | |
dc.date.issued |
2008-07-01 | en_US |
dc.description.abstract |
We give a simple construction of distance-preserving Mappings from ternary vectors to permutations (3-DPM). Our result gives a lower bound for permutation arrays, i.e., P(n, d) >= A(3)(n, d), which significantly improves previous lower bounds for d <= 3n/5. | en_US |
dc.identifier.doi |
10.1109/TIT.2008.924716 | 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.2008.924716 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/8611 | |
dc.identifier.wosnumber |
WOS:000257111500034 | |
dc.language.iso |
en_US | en_US |
dc.subject |
code constructions | en_US |
dc.subject |
distance-preserving mappings | en_US |
dc.subject |
permutation arrays | en_US |
dc.subject |
ternary codes | en_US |
dc.title |
Simple distance-preserving mappings from ternary vectors to permutations | en_US |
dc.type |
Article | en_US |
檔案
- 000257111500034.pdf (322.5 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Lin, T.-T., Tsai, S.-C., & Wu, H.-L. (2008). Simple distance-preserving mappings from ternary vectors to permutations. IEEE TRANSACTIONS ON INFORMATION THEORY, 54(7), 3251–3256. https://doi.org/10.1109/TIT.2008.924716
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/8611