New Constructions of Permutation Arrays

Details New Constructions of Permutation Arrays New Constructions of Permutation Arrays

2008-01-25

arxiv.org/abs/0801.3987v1

Computer Science

Information Theory

Scientific paper

A permutation array(permutation code, PA) 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$. In this correspondence, we present two constructions of PA from fractional polynomials over finite field, and a construction of $(n,d)$ PA from permutation group with degree $n$ and minimal degree $d$. All these new constructions produces some new lower bounds for PA.

Affiliated with

Also associated with

No associations

Rating

New Constructions 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 Constructions of Permutation Arrays, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New Constructions of Permutation Arrays will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-413068