Coding with permutations
From MaRDI portal
Cited in
(23)- Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes
- Error-correcting codes from permutation groups
- On sharply edge-transitive permutation groups
- Bounds for permutation arrays
- Consolidation for compact constraints and Kendall tau LP decodable permutation codes
- Coding for locality in reconstructing permutations
- Constructing permutation arrays from groups
- Covering radius for sets of permutations
- Designs in finite metric spaces: a probabilistic approach
- Covering radius of permutation groups with infinity-norm
- New lower bounds for permutation arrays using contraction
- Diagonally neighbour transitive codes and frequency permutation arrays
- Transversals of Latin squares and covering radius of sets of permutations
- The covering radius of permutation designs
- Distance Enumerators for Permutation Groups
- New nonexistence results on perfect permutation codes under the Hamming metric
- scientific article; zbMATH DE number 7790332 (Why is no real title available?)
- Transitivity in finite general linear groups
- A McEliece cryptosystem using permutation codes
- Upper bounds on the size of permutation codes with a Hamming distance of five
- New lower bounds for permutation codes in the Ulam metric
- Constructing permutation codes under the generalized Kendall- metric
- Permutation codes
This page was built for publication: Coding with permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3205158)
