Multiple contractions of permutation arrays

09/28/2021
by   Carmen Amarra, et al.
0

Given a permutation σ on n symbols {0, 1, …, n-1} and an integer 1 ≤ m ≤ n-1, the mth contraction of σ is the permutation σ^CT^m on n-m symbols obtained by deleting the symbols n-1, n-2, …, n-m from the cycle decomposition of σ. The Hamming distance hd(σ,τ) between two permutations σ and τ is the number of symbols x such that σ(x) ≠τ(x), and the Hamming distance of a non-empty set of permutations is the least Hamming distance among all pairs of distinct elements of the set. In this paper we identify how repeated contractions affect the Hamming distance between two permutations, and use it to obtain new lower bounds for the maximum possible size of a set of permutations on q-1 symbols, for certain prime powers q, having Hamming distance q-5, and for a set of permutations on q - m symbols, for certain prime powers q and 3 ≤ m ≤ 9, having Hamming distance q-1-2m.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/11/2018

Maximizing Hamming Distance in Contraction of Permutation Arrays

A permutation array A is set of permutations on a finite set Ω, say of ...
research
04/23/2018

Constructing Permutation Arrays using Partition and Extension

We give new lower bounds for M(n,d), for various positive integers n and...
research
04/16/2019

Equivalence classes of small tilings of the Hamming cube

The study of tilings is a major problem in many mathematical instances, ...
research
05/08/2018

A construction of product blocks with a fixed block size

Let M(n,d) be the maximum size of a permutation array on n symbols with ...
research
10/03/2019

A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT

X3SAT is the problem of whether one can satisfy a given set of clauses w...
research
10/05/2021

Optimal N-ary ECOC Matrices for Ensemble Classification

A new recursive construction of N-ary error-correcting output code (ECOC...
research
10/19/2019

Kernels of Mallows Models under the Hamming Distance for solving the Quadratic Assignment Problem

The Quadratic Assignment Problem (QAP) is a well-known permutation-based...

Please sign up or login with your details

Forgot password? Click here to reset