A survey on packing and covering problems in the Hamming permutation space
From MaRDI portal
Publication:2501003
zbMATH Open1099.05022MaRDI QIDQ2501003FDOQ2501003
Authors: Jörn Quistorff
Publication date: 30 August 2006
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/126581
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Cited In (7)
- A bound on permutation codes
- A five-element transformation monoid on labelled trees
- Transversals of Latin squares and covering radius of sets of permutations
- The multicovering radius problem for some types of discrete structures
- Covering radius of permutation groups with infinity-norm
- Covering radius in the Hamming permutation space
- Permutation codes with specified packing radius
This page was built for publication: A survey on packing and covering problems in the Hamming permutation space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2501003)