Two constructions of permutation arrays

Authors:
Fang-Wei Fu;T. Klove
Affiliations:
Dept. of Math., Nat. Univ. of Singapore, Singapore;-
Venue:
IEEE Transactions on Information Theory
Year:
2004

Citing 0
Cited 6

On the Construction of Permutation Arrays via Mappings from Binary Vectors to Permutations

Designs, Codes and Cryptography
A random construction for permutation codes and the covering radius

Designs, Codes and Cryptography
New simple constructions of distance-increasing mappings from binary vectors to permutations

Information Processing Letters
Correcting limited-magnitude errors in the rank-modulation scheme

IEEE Transactions on Information Theory
Optimal permutation anticodes with the infinity norm via permanents of (0,1)-matrices

Journal of Combinatorial Theory Series A
An image encryption algorithm based on small permutation array combining

IScIDE'11 Proceedings of the Second Sino-foreign-interchange conference on Intelligent Science and Intelligent Data Engineering

Quantified Score

Hi-index	754.90

Visualization

Abstract

In this correspondence, two new constructions of permutation arrays are given. A number of examples to illustrate the constructions are also provided.