New nonexistence results on perfect permutation codes under the Hamming metric
From MaRDI portal
Publication:6047439
DOI10.3934/amc.2021058zbMath1529.94056OpenAlexW4206339770MaRDI QIDQ6047439
Publication date: 12 September 2023
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2021058
Cites Work
- Unnamed Item
- Unnamed Item
- On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-metric
- A new table of permutation codes
- On the maximum number of permutations with given maximal or minimal distance
- Bounds for permutation arrays
- Upper bounds on permutation codes via linear programming
- New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric
- Constructions for permutation codes in powerline communications
- Nonexistence of perfect permutation codes under the Kendall \(\tau\)-metric
- Bounds on permutation codes of distance four
- Snake-in-the-box codes under the \(\ell_{\infty}\)-metric for rank modulation
- 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
- Snake-in-the-Box Codes for Rank Modulation
- Coding with permutations
- Two Constructions of Permutation Arrays
- Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
- Constructions of permutation arrays
- Permutation codes for discrete channels (Corresp.)
- Codes in Permutations and Error Correction for Rank Modulation
- Permutation Arrays Under the Chebyshev Distance
- Correcting Charge-Constrained Errors in the Rank-Modulation Scheme
