Coding with permutations
From MaRDI portal
Publication:3205158
DOI10.1016/S0019-9958(79)90076-7zbMath0415.94010MaRDI QIDQ3205158
Gérard D. Cohen, Michel Marie Deza, Ian F. Blake
Publication date: 1979
Published in: Information and Control (Search for Journal in Brave)
decodingpermutation codespermutation arraysminimal degree of permutation groupsmultiply transitive finite groups
Other types of codes (94B60) Combinatorial codes (94B25) Decoding (94B35) Multiply transitive finite groups (20B20)
Related Items
Consolidation for compact constraints and Kendall tau LP decodable permutation codes ⋮ New nonexistence results on perfect permutation codes under the Hamming metric ⋮ Coding for locality in reconstructing permutations ⋮ The covering radius of permutation designs ⋮ On sharply edge-transitive permutation groups ⋮ Unnamed Item ⋮ Diagonally neighbour transitive codes and frequency permutation arrays ⋮ Constructing permutation arrays from groups ⋮ Permutation codes ⋮ Distance Enumerators for Permutation Groups ⋮ Covering radius for sets of permutations ⋮ Transversals of Latin squares and covering radius of sets of permutations ⋮ Bounds for permutation arrays ⋮ Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes ⋮ Covering radius of permutation groups with infinity-norm ⋮ Designs in finite metric spaces: a probabilistic approach ⋮ New lower bounds for permutation arrays using contraction ⋮ Error-correcting codes from permutation groups
