Covering radius in the Hamming permutation space

DOI10.1016/j.ejc.2019.103025zbMath1428.05008arXiv1811.09040OpenAlexW2900739425WikidataQ127173294 ScholiaQ127173294MaRDI QIDQ2011145

Kevin Hendrey, Ian M. Wanless

Publication date: 28 November 2019

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

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

zbMATH Keywords

Hamming distance

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (2)

All group‐based latin squares possess near transversals ⋮ Covering radius of permutation groups with infinity-norm

Cites Work

• Unnamed Item
• A random construction for permutation codes and the covering radius
• On the ratio of optimal integral and fractional covers
• Covering radius for sets of permutations
• The multicovering radius problem for some types of discrete structures
• Latin squares with no transversals
• A survey on packing and covering problems in the Hamming permutation space
• Transversals of Latin squares and covering radius of sets of permutations
• Degree Conditions for Matchability in 3‐Partite Hypergraphs
• Intersecting families of permutations

This page was built for publication: Covering radius in the Hamming permutation space