The covering radius of permutation designs

08/09/2021
by   Patrick Solé, et al.
0

A notion of t-designs in the symmetric group on n letters was introduced by Godsil in 1988. In particular t-transitive sets of permutations form a t-design. We derive upper bounds on the covering radius of these designs, as a function of n and t and in terms of the largest zeros of Charlier polynomials.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/13/2018

The Covering Radius of the Reed--Muller Code RM(2,7) is 40

It was proved by J. Schatz that the covering radius of the second order ...
research
05/17/2021

Designs, permutations, and transitive groups

A notion of t-designs in the symmetric group on n letters was introduced...
research
06/25/2021

The Covering Radius of the Reed-Muller Code RM(m-4,m) in RM(m-3,m)

We present methods for computing the distance from a Boolean polynomial ...
research
09/25/2020

Computing the covering radius of a polytope with an application to lonely runners

We are concerned with the computational problem of determining the cover...
research
02/05/2023

Quantized-Constraint Concatenation and the Covering Radius of Constrained Systems

We introduce a novel framework for implementing error-correction in cons...
research
05/16/2020

Efficient quantization and weak covering of high dimensional cubes

Let ℤ_n = {Z_1, ..., Z_n} be a design; that is, a collection of n points...
research
01/15/2021

Random and quasi-random designs in group testing

For large classes of group testing problems, we derive lower bounds for ...

Please sign up or login with your details

Forgot password? Click here to reset