Simple distance-preserving mappings from ternary vectors to permutations

标题:	Simple distance-preserving mappings from ternary vectors to permutations
作者:	Lin, Te-Tsung Tsai, Shi-Chum Wu, Hsin-Lung 资讯工程学系 Department of Computer Science
关键字:	code constructions;distance-preserving mappings;permutation arrays;ternary codes
公开日期:	1-七月-2008
摘要:	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.
URI:	http://dx.doi.org/10.1109/TIT.2008.924716 http://hdl.handle.net/11536/8611
ISSN:	0018-9448
DOI:	10.1109/TIT.2008.924716
期刊:	IEEE TRANSACTIONS ON INFORMATION THEORY
Volume:	54
Issue:	7
起始页:	3251
结束页:	3256
显示于类别：	Articles

文件中的档案：

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.

APA	Lin, T., Tsai, S., & Wu, H. (2008). Simple distance-preserving mappings from ternary vectors to permutations. WOS:000257111500034.
Bibtex	@article{Lin2008Simple, title={Simple distance-preserving mappings from ternary vectors to permutations}, author={Lin, Te-Tsung and Tsai, Shi-Chum and Wu, Hsin-Lung}, journal={WOS:000257111500034}, year={2008}, url={https://ir.lib.nycu.edu.tw/handle/11536/8611?locale=zh_CN&mode=fulllocale%3Dzh_TWlocale%3Dzh_CNlocale%3Dzh_TW}, }