Constructing permutation arrays from groups |
| |
Authors: | Sergey Bereg Avi Levy I Hal Sudborough |
| |
Institution: | 1.Department of Computer Science, Erik Jonsson School of Engineering and Computer Science,University of Texas at Dallas,Richardson,USA;2.Department of Mathematics,University of Washington,Seattle,USA |
| |
Abstract: | Let M(n, d) be the maximum size of a permutation array on n symbols with pairwise Hamming distance at least d. We use various combinatorial, algebraic, and computational methods to improve lower bounds for M(n, d). We compute the Hamming distances of affine semilinear groups and projective semilinear groups, and unions of cosets of AGL(1, q) and PGL(2, q) with Frobenius maps to obtain new, improved lower bounds for M(n, d). We give new randomized algorithms. We give better lower bounds for M(n, d) also using new theorems concerning the contraction operation. For example, we prove a quadratic lower bound for \(M(n,n-2)\) for all \(n\equiv 2 \pmod 3\) such that \(n+1\) is a prime power. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|