Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | Keywords |
|---|---|---|
2008 | Clinical Orthopaedics and Related Research | lower bound,hamming distance,permutation group,information theory,finite field |
Field | DocType | Volume |
Permutation graph,Discrete mathematics,Combinatorics,Permutation,Permutation group,Cyclic permutation,Bit-reversal permutation,Parity of a permutation,Partial permutation,Mathematics,Base (group theory) | Journal | abs/0801.3 |
Citations | PageRank | References |
1 | 0.38 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lizhen Yang | 1 | 51 | 4.52 |
| Kefei Chen | 2 | 1178 | 107.83 |
| Yuan Luo | 3 | 325 | 45.06 |