New theoretical bounds and constructions of permutation codes under block permutation metric
From MaRDI portal
Publication:2329402
DOI10.1007/s10623-019-00641-wzbMath1421.94119arXiv1811.04600OpenAlexW2963869041WikidataQ127866705 ScholiaQ127866705MaRDI QIDQ2329402
Yiwei Zhang, Gennian Ge, Zixiang Xu
Publication date: 17 October 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.04600
independence numberpermutation codessphere-packing boundblock permutation metricGilbert--Varshamov bound
Related Items (1)
Cites Work
- Counting permutations by their rigid patterns
- A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
- A note on Ramsey numbers
- New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric
- Systematic Error-Correcting Codes for Permutations and Multi-Permutations
- Snake-in-the-Box Codes for Rank Modulation Under Kendall’s $\tau $ -Metric
- 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
- Asymptotic Improvement of the Gilbert–Varshamov Bound on the Size of Binary Codes
- Lower bounds for constant weight codes
- Theoretical Bounds and Constructions of Codes in the Generalized Cayley Metric
- Unnamed Item
- Unnamed Item
This page was built for publication: New theoretical bounds and constructions of permutation codes under block permutation metric
