The following pages link to Coding with permutations (Q3205158):
Displaying 18 items.
- Permutation codes (Q966159) (← links)
- Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes (Q1009036) (← links)
- Error-correcting codes from permutation groups (Q1043942) (← links)
- On sharply edge-transitive permutation groups (Q1159687) (← links)
- Bounds for permutation arrays (Q1248524) (← links)
- Consolidation for compact constraints and Kendall tau LP decodable permutation codes (Q1675286) (← links)
- Coding for locality in reconstructing permutations (Q1696052) (← links)
- Constructing permutation arrays from groups (Q1744019) (← links)
- Covering radius for sets of permutations (Q1779486) (← links)
- Designs in finite metric spaces: a probabilistic approach (Q2051880) (← links)
- Covering radius of permutation groups with infinity-norm (Q2297719) (← links)
- New lower bounds for permutation arrays using contraction (Q2324789) (← links)
- Diagonally neighbour transitive codes and frequency permutation arrays (Q2454089) (← links)
- Transversals of Latin squares and covering radius of sets of permutations (Q2509702) (← links)
- The covering radius of permutation designs (Q2688257) (← links)
- Distance Enumerators for Permutation Groups (Q5426293) (← links)
- New nonexistence results on perfect permutation codes under the Hamming metric (Q6047439) (← links)
- (Q6177588) (← links)