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=2 (mod 3) such that n+1 is a prime power.
Recommendations
- New lower bounds for permutation arrays using contraction
- Using permutation rational functions to obtain permutation arrays with large Hamming distance
- Improved lower bounds for permutation arrays using permutation rational functions
- Constructing permutation arrays using partition and extension
- Constructions of permutation arrays
Cites work
- scientific article; zbMATH DE number 5995471 (Why is no real title available?)
- scientific article; zbMATH DE number 3906699 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1261512 (Why is no real title available?)
- scientific article; zbMATH DE number 1284415 (Why is no real title available?)
- scientific article; zbMATH DE number 1461254 (Why is no real title available?)
- scientific article; zbMATH DE number 894528 (Why is no real title available?)
- scientific article; zbMATH DE number 3286093 (Why is no real title available?)
- scientific article; zbMATH DE number 967590 (Why is no real title available?)
- A new table of permutation codes
- An Improvement on the Gilbert–Varshamov Bound for Permutation Codes
- Coding with permutations
- Constructions for permutation codes in powerline communications
- Extending permutation arrays: improving MOLS bounds
- On the maximum number of permutations with given maximal or minimal distance
- Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
- Permutation codes invariant under isometries
- Powerline communication and the 36 officers problem
Cited in
(13)- A construction of product blocks with a fixed block size
- Two Constructions of Permutation Arrays
- Tests and proofs for custom data generators
- Constructions of permutation arrays
- Improved lower bounds for permutation arrays using permutation rational functions
- New lower bounds for permutation arrays using contraction
- Multiple contractions of permutation arrays
- Using permutation rational functions to obtain permutation arrays with large Hamming distance
- The maximum clique problem for permutation Hamming graphs
- Constructing permutation arrays using partition and extension
- Classes of permutation arrays in finite projective spaces
- A note on good permutation codes from Reed-Solomon codes
- Intersection theorems in permutation groups
This page was built for publication: Constructing permutation arrays from groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744019)
