New Upper Bounds on Sizes of Permutation Arrays
| dc.creator | Yang, Lizhen | |
| dc.creator | Dong, Ling | |
| dc.creator | Chen, Kefei | |
| dc.date | 2008-01-25 | |
| dc.date.accessioned | 2026-07-07T08:56:32Z | |
| dc.date.available | 2026-07-07T08:56:32Z | |
| dc.description | 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 $α,β$ satisfying certain conditions, whenever $d=βn^α$, the new upper bounds are asymptotically better than the previous ones. | |
| dc.identifier | https://arxiv.org/abs/0801.3983 | |
| dc.identifier | http://arxiv.org/abs/0801.3983 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/146642 | |
| dc.subject | Information Theory | |
| dc.title | New Upper Bounds on Sizes of Permutation Arrays | |
| dc.type | text |