New Upper Bounds on Sizes of Permutation Arrays

Details New Upper Bounds on Sizes of Permutation Arrays New Upper Bounds on Sizes of Permutation Arrays

2008-01-25

arxiv.org/abs/0801.3983v1

Computer Science

Information Theory

Scientific paper

A permutation array(or code) of length $n$ and distance $d$, denoted by $(n,d)$ PA, is a set of permutations $C$ from some fixed set of $n$ elements such that the Hamming distance between distinct members $\mathbf{x},\mathbf{y}\in C$ is at least $d$. Let $P(n,d)$ denote the maximum size of an $(n,d)$ PA. New upper bounds on $P(n,d)$ are given. For constant $\alpha,\beta$ satisfying certain conditions, whenever $d=\beta n^{\alpha}$, the new upper bounds are asymptotically better than the previous ones.

Affiliated with

Also associated with

No associations

Rating

New Upper Bounds on Sizes of Permutation Arrays does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with New Upper Bounds on Sizes of Permutation Arrays, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New Upper Bounds on Sizes of Permutation Arrays will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-412881