DocumentCode :
755843
Title :
Simple Distance-Preserving Mappings From Ternary Vectors to Permutations
Author :
Lin, Te-Tsung ; Tsai, Shi-Chun ; Wu, Hsin-Lung
Author_Institution :
Dept. of Comput. Sci., Nat. Chiao-Tung Univ., Hsinchu
Volume :
54
Issue :
7
fYear :
2008
fDate :
7/1/2008 12:00:00 AM
Firstpage :
3251
Lastpage :
3256
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) ges A3 (n, d) , which significantly improves previous lower bounds for d les 3n / 5.
Keywords :
ternary codes; distance-preserving mappings; permutation arrays; ternary codes; ternary vectors; Binary codes; Computer science; Code constructions; distance-preserving mappings; permutation arrays; ternary codes;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2008.924716
Filename :
4544975
Link To Document :
بازگشت