New Constructions of Permutation Arrays

Simple item page
dc.creatorYang, Lizhen
dc.creatorChen, Kefei
dc.creatorYuan, Luo
dc.date2008-01-25
dc.date.accessioned2026-07-07T08:56:32Z
dc.date.available2026-07-07T08:56:32Z
dc.descriptionA 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.
dc.identifierhttps://arxiv.org/abs/0801.3987
dc.identifierhttp://arxiv.org/abs/0801.3987
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/146644
dc.subjectInformation Theory
dc.titleNew Constructions of Permutation Arrays
dc.typetext

Files

Collections

arXiv