Nonexistence of perfect permutation codes under the \ell _{\infty }-metric

DOI10.1007/S00200-022-00556-5MaRDI QIDQ6489327zbMATH OpenFDO

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)

Mathematics Subject Classification ID

Information theory (general) (94A15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

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

Cites work

• scientific article; zbMATH DE number 3458807 (Why is no real title available?)
• An application of permutatation arrays to block ciphers
• Bounds on the Size of Permutation Codes With the Kendall <inline-formula> <tex-math notation="LaTeX">$\tau $ </tex-math></inline-formula>-Metric
• Codes in Permutations and Error Correction for Rank Modulation
• Correcting Charge-Constrained Errors in the Rank-Modulation Scheme
• Correcting Limited-Magnitude Errors in the Rank-Modulation Scheme
• Error-Correction in Flash Memories via Codes in the Ulam Metric
• Improved Lower Bounds on the Size of Balls Over Permutations With the Infinity Metric
• Lower bounds on the size of spheres of permutations under the Chebychev distance
• New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric
• Nonexistence of perfect permutation codes under the Kendall \(\tau\)-metric
• On the Labeling Problem of Permutation Group Codes Under the Infinity Metric
• On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-metric
• Permutation Arrays Under the Chebyshev Distance
• Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
• Snake-in-the-Box Codes for Rank Modulation
• Snake-in-the-box codes under the \(\ell_{\infty}\)-metric for rank modulation
• Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices

Cited in

(1)

• New nonexistence results on perfect permutation codes under the Hamming metric

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)