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
顯示於類別：	期刊論文

文件中的檔案：

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。