The covering radius of permutation designs

DOI10.1007/s10801-022-01169-4OpenAlexW3191803311MaRDI QIDQ2688257

Patrick Solé

Publication date: 2 March 2023

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

orthogonal polynomialspolynomial spacestransitive sets of permutations

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Other designs, configurations (05B30) Permutation groups (20B99)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sharp bounds for the extreme zeros of classical orthogonal polynomials
• Permutation codes
• Upper bounds on permutation codes via linear programming
• Covering radius for sets of permutations
• Polynomial spaces
• Bounds for zeros of the Charlier polynomials.
• Coding with permutations
• Packing radius, covering radius, and dual distance
• Zeros of classical orthogonal polynomials of a discrete variable

This page was built for publication: The covering radius of permutation designs