Nonexistence of perfect permutation codes under the $$\ell _{\infty }$$-metric
From MaRDI portal
Publication:6489327
DOI10.1007/S00200-022-00556-5MaRDI QIDQ6489327
Wenjuan Yin, Fang-Wei Fu, Xiang Wang
Publication date: 21 April 2024
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information theory (general) (94A15)
Cites Work
- Unnamed Item
- Unnamed Item
- On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-metric
- New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric
- Nonexistence of perfect permutation codes under the Kendall \(\tau\)-metric
- Snake-in-the-box codes under the \(\ell_{\infty}\)-metric for rank modulation
- Lower bounds on the size of spheres of permutations under the Chebychev distance
- 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
- On the Labeling Problem of Permutation Group Codes Under the Infinity Metric
- Snake-in-the-Box Codes for Rank Modulation
- Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
- Improved Lower Bounds on the Size of Balls Over Permutations With the Infinity Metric
- 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
- Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices
This page was built for publication: Nonexistence of perfect permutation codes under the $$\ell _{\infty }$$-metric
