Simple Distance-Preserving Mappings From Ternary Vectors to Permutations

Authors:
Te-Tsung Lin;Shi-Chun Tsai;Hsin-Lung Wu
Affiliations:
Dept. of Comput. Sci., Nat. Chiao-Tung Univ., Hsinchu;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2008

Citing 0
Cited 3

Distance-increasing mappings from binary vectors to constant composition vectors

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Decoding permutation arrays with ternary vectors

Designs, Codes and Cryptography
Constructing Constant Composition Codes via Distance-Increasing Mappings

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	754.84

Visualization

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.