Decoding permutation arrays with ternary vectors

Authors:
Chia-Jung Lee;Te-Tsung Lin;Min-Zheng Shieh;Shi-Chun Tsai;Hsin-Lung Wu
Affiliations:
Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan and Institute of Information Science, Academia Sinica, Taipei, Taiwan 11529;Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan;Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan;Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan;Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan and Department of Computer Science and Information Engineering, National Taipei University, Taipei, Taiwan 237
Venue:
Designs, Codes and Cryptography
Year:
2011

Citing 4
Cited 0

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Permutation arrays under the Chebyshev distance

IEEE Transactions on Information Theory
Distance-preserving mappings from binary vectors to permutations

IEEE Transactions on Information Theory
Simple Distance-Preserving Mappings From Ternary Vectors to Permutations

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give an explicit decoding scheme for the permutation arrays under Hamming distance metric, where the encoding is constructed via a distance-preserving mapping from ternary vectors to permutations (3-DPM).