Nonexistence of perfect permutation codes under the \ell _{\infty }-metric
From MaRDI portal
Publication:6489327
DOI10.1007/S00200-022-00556-5MaRDI QIDQ6489327FDOQ6489327
Authors: Xiang Wang, Wenjuan Yin, Fangwei Fu 
Publication date: 21 April 2024
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Recommendations
- New nonexistence results on perfect permutation codes under the Hamming metric
- Nonexistence of perfect permutation codes under the Kendall \(\tau\)-metric
- New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric
- New theoretical bounds and constructions of permutation codes under block permutation metric
- Permutation codes with specified packing radius
Information theory (general) (94A15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- Title not available (Why is that?)
- Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices
- Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
- An application of permutatation arrays to block ciphers
- Lower bounds on the size of spheres of permutations under the Chebychev distance
- Correcting Limited-Magnitude Errors in the Rank-Modulation Scheme
- Permutation Arrays Under the Chebyshev Distance
- Snake-in-the-Box Codes for Rank Modulation
- 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
- Codes in Permutations and Error Correction for Rank Modulation
- Correcting Charge-Constrained Errors in the Rank-Modulation Scheme
- Snake-in-the-box codes under the \(\ell_{\infty}\)-metric for rank modulation
- 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
- Improved Lower Bounds on the Size of Balls Over Permutations With the Infinity Metric
- On the Labeling Problem of Permutation Group Codes Under the Infinity Metric
Cited In (1)
This page was built for publication: Nonexistence of perfect permutation codes under the $$\ell _{\infty }$$-metric
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6489327)
