New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric

DOI10.1007/s10623-016-0321-5zbMath1417.94117arXiv1611.07188OpenAlexW2556566346MaRDI QIDQ1675288

Gennian Ge, Xin Wang, Yiwei Zhang, Yiting Yang

Publication date: 27 October 2017

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

independent setGilbert-Varshamov boundpermutation codesHamming metricKendall's \(\tau \)-metric

Mathematics Subject Classification ID

Bounds on codes (94B65) Combinatorial codes (94B25)

Related Items (11)

Using permutation rational functions to obtain permutation arrays with large Hamming distance ⋮ New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric ⋮ New nonexistence results on perfect permutation codes under the Hamming metric ⋮ New upper bounds on the size of permutation codes under Kendall \(\tau\)-metric ⋮ Reconstruction of permutations distorted by single Kendall \(\tau\)-errors ⋮ Erdös--Falconer Distance Problem under Hamming Metric in Vector Spaces over Finite Fields ⋮ Improved lower bounds for permutation arrays using permutation rational functions ⋮ Nonexistence of perfect permutation codes under the Kendall \(\tau\)-metric ⋮ Constructing permutation arrays using partition and extension ⋮ New lower bounds for permutation arrays using contraction ⋮ New theoretical bounds and constructions of permutation codes under block permutation metric

Cites Work

• Unnamed Item
• Unnamed Item
• Theorems in the additive theory of numbers
• On the maximum number of permutations with given maximal or minimal distance
• New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric
• Constructions for permutation codes in powerline communications
• Bounds on the Size of Permutation Codes With the Kendall <inline-formula> <tex-math notation="LaTeX">$\tau $ </tex-math></inline-formula>-Metric
• Error-Correction in Flash Memories via Codes in the Ulam Metric
• An Improvement on the Gilbert–Varshamov Bound for Permutation Codes
• Constructions of Rank Modulation Codes
• Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
• Rank Modulation for Flash Memories
• Codes in Permutations and Error Correction for Rank Modulation
• Correcting Limited-Magnitude Errors in the Rank-Modulation Scheme
• Permutation Arrays Under the Chebyshev Distance
• Correcting Charge-Constrained Errors in the Rank-Modulation Scheme

This page was built for publication: New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric