Constructing permutation arrays from groups

DOI10.1007/S10623-017-0381-1zbMATH Open1396.05003arXiv1511.04494OpenAlexW2963221477MaRDI QIDQ1744019FDOQ1744019

Authors: Sergey Bereg, Avi Levy, I. H. Sudborough 

Publication date: 16 April 2018

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1511.04494

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

zbMATH Keywords

groupsfinite fieldspermutation codespermutation arrays

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial codes (94B25) Group actions on combinatorial structures (05E18)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the maximum number of permutations with given maximal or minimal distance
• Title not available (Why is that?)
• Title not available (Why is that?)
• Constructions for permutation codes in powerline communications
• Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
• Powerline communication and the 36 officers problem
• Title not available (Why is that?)
• A new table of permutation codes
• Title not available (Why is that?)
• Permutation codes invariant under isometries
• An Improvement on the Gilbert–Varshamov Bound for Permutation Codes
• Extending permutation arrays: improving MOLS bounds
• Coding with permutations

Cited In (13)

• 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
• A note on good permutation codes from Reed-Solomon codes
• Classes of permutation arrays in finite projective spaces
• Intersection theorems in permutation groups
• A construction of product blocks with a fixed block size

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)