Non-Existence of Perfect Permutation Codes Under Crown Poset Metric
Permutation codes have been extensively investigated using various metrics such as Hamming metric, Ulam metric, Kendall τ metric, l<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</sub> metric, Cayley metric etc., due to their potential applications in diverse fields such as rank modulation schemes for flash memories, block ciphers and powerline communications. In this article, we define permutation codes under the poset metric and established bounds for packing radius and covering radius. Moreover, we specifically addressed implementation of the results based on the crown poset metric. Additionally, we demonstrated the nonexistence of some perfect permutation codes such as alternating group, <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">G</i><sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2<i>n</i></sub> is the permutation code generated by the permutation (1 2 3... 2<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i>), <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">H</i> is the permutation code generated by the two permutations such as (1 2 3 ... 2<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i>) and (1 2<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i>)(2 2<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i>−1)...(<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n n</i>+1), where, <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i> > <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k</i>, <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">G</i><sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sub> is the permutation code generated by the permutation (1 2 3... <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i>) under the crown poset metric.
Authors
- Venkatrajam Marka (ORCID: https://orcid.org/0000-0003-4570-6026)
- Rohini Baliram More (ORCID: https://orcid.org/0009-0006-3907-608X)
Institutions
- SRM University (IN)
- VIT-AP University
Publication Details
- Journal
- IEEE Access
- Published
- 2025-01-01
- DOI
- https://doi.org/10.1109/access.2025.3602712
- Primary Topic
- Cooperative Communication and Network Coding
- Type
- article
- Field-Weighted Citation Impact
- 0.00