Published in 2026
[1] A. Abdollahi, H. Eskandari, J. Bagherian, F. Jafari, M. Khatami, F. Parvaresh and R. Sobhani, The sequence reconstruction of permutations under Hamming metric with small errors, Cryptography and Communications, (2026).
[2] A. Abdollahi, J. Bagherian, F. Jafari, M. Khatami, F. Parvaresh, A. Orak and R. Sobhani, Rank modulation codes for DNA storage in shotgun sequencing: Structure and distance properties, Discrete Mathematics, 349 (2026), 11, 115253.
[3] R. Sobhani, F. Parvaresh, A. Abdollahi, F. Abedi, J. Bagherian and M. Khatami, On Enumerating Feasible Permutations for Rank Modulation Codes in DNA storage via Hyperplane Arrangements, IEEE Transactions on Information Theory, 72(2026), no. 8, pp 5490-5500.
Published in 2025
-
F. Parvaresh, R. Sobhani, A. Abdollahi, J. Bagherian, F. Jafari, and M. Khatami, Improved bounds on the size of permutation codes under Kendall $\tau$-metric, IEEE Transactions on Information Theory, 71(2025), no. 6, pp. 4156-4166.
-
A. Abdollahi, J. Bagherian, F. Jafari, M. Khatami, F.Parvaresh and R. Sobhani, Upper bounds on the size of permutation codes with Hamming distance of five, cryptography and communications, 17 (2025), 1075-1091.
-
X. Wang, F. W. Fu, and E. V. Konstantinova, “The Sequence Reconstruction of Permutations with Hamming Metric,” Designs, Codes and Cryptography, vol. 93, pp. 11–37, 2025.
-
A. Rosowski, “On the Subgroup Distance Problem in Cyclic Permutation Groups,” arXiv preprint arXiv:2504.06844, 2025.
Published in 2024
-
X. Wang, S. J. Xu, and S. Zhou, “On Regular Sets in Cayley Graphs,” Journal of Algebraic Combinatorics, vol. 59, pp. 735–759, 2024.
-
J. Zhang, “On Subgroup Perfect Codes in Cayley Sum Graphs,” Finite Fields and Their Applications, vol. 95, Art. no. 102393, 2024.
-
X. Wang, L. Wei, S. J. Xu, and S. Zhou, “Subgroup Total Perfect Codes in Cayley Sum Graphs,” Designs, Codes and Cryptography, pp. 1–15, 2024.
-
S. Wang, Y. M. Chee, and V. K. Vu, “Permutation Codes in Levenshtein, Ulam and Generalized Kendall–Tau Metrics,” in Proceedings of the 2024 IEEE International Symposium on Information Theory (ISIT), Athens, Greece, 2024, pp. 43–48.
-
F. Parvaresh, R. Sobhani, A. Abdollahi, J. Bagherian, F. Jafari, and M. Khatami, “Improved Bounds on the Size of Permutation Codes under the Kendall τ\tauτ-Metric,” arXiv preprint arXiv:2406.06029, 2024.
-
T. Nguyen, “Improving the Gilbert–Varshamov Bound for Permutation Codes in the Cayley Metric and Kendall τ\tauτ-Metric,” arXiv preprint arXiv:2404.15126, 2024.
-
A. Diaz-Lopez, K. Haymaker, K. Keough, J. Park, and E. White, “Metrics on Permutations with the Same Peak Set,” arXiv preprint arXiv:2401.10719, 2024.