New Upper Bounds on Sizes of Permutation Arrays

@article{Yang2008NewUB,
  title={New Upper Bounds on Sizes of Permutation Arrays},
  author={Lizhen Yang and Ling Dong and Kefei Chen},
  journal={CoRR},
  year={2008},
  volume={abs/0801.3983}
}
A permutation array(or code) of length n and distanced, denoted by(n, d) PA, is a set of permutationsC from some fixed set of n elements such that the Hamming distance between distinct membersx,y ∈ C is at leastd. Let P (n, d) denote the maximum size of an ( , d) PA. New upper bounds onP (n, d) are given. For constant α, β satisfying certain conditions, whenever d = βn, the new upper bounds are asymptotically better than the previou s ones. 

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…