Fatemeh Jafari
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Fatemeh Jafari has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Alireza Abdollahi
Department of Pure Mathematics, Faculty of Mathematics and Statistics, University of Isfahan, Isfahan, Iran
5 shared publications - Maryam Khatami
Department of Pure Mathematics, Faculty of Mathematics and Statistics, University of Isfahan, Isfahan, Iran
5 shared publications - Reza Sobhani
Department of Applied Mathematics and Computer Science, Faculty of Mathematics and Statistics, University of Isfahan, Isfahan, Iran
5 shared publications - Farzad Parvaresh
Department of Electrical Engineering, Faculty of Engineering, University of Isfahan, Isfahan, Iran
4 shared publications - Javad Bagherian
Department of Pure Mathematics, Faculty of Mathematics and Statistics, University of Isfahan, Isfahan, Iran
4 shared publications - H. Eskandari
Department of Pure Mathematics, Faculty of Mathematics and Statistics, University of Isfahan, Isfahan, Iran
1 shared publication
Latest Publications
- 19 May 2026
- Published by Springer Nature in Cryptography and Communications
- Vol. 18 (5) , 1-16
The sequence reconstruction of permutations under hamming metric with small errors
- 19 May 2026
- Published by Springer Nature in Cryptography and Communications
- Vol. 18 (5) , 1-16
The sequence reconstruction of permutations under hamming metric with small errors
- 24 May 2025
- Published by Springer Nature in Cryptography and Communications
- Vol. 17 (4) , 1075-1091
Upper bounds on the size of permutation codes with a Hamming distance of five
- 24 May 2025
- Published by Springer Nature in Cryptography and Communications
- Vol. 17 (4) , 1075-1091
Upper bounds on the size of permutation codes with a Hamming distance of five
- 15 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (6) , 4156-4166
Improved Bounds on the Size of Permutation Codes Under Kendall τ -Metric
In order to overcome the challenges caused by flash memories and also to protect against errors related to reading information stored in DNA molecules in the shotgun sequencing method, the rank modulation method has been proposed. In the rank modulation framework, codewords are permutations. In this paper, we study the largest size P(n, d) of permutation codes of length n, i.e., subsets of the set Sn of all permutations on {1, ..., n} with the minimum distance at least d ∈ {1, ..., (n/2)} under the Kendall τ-metric. By presenting an algorithm and two theorems, we improve the known lower and upper bounds for P(n, d). In particular, we show that P(n, d) = 4 for all n ≥ 6 and 3/5 (n/2) < d ≤ 2/3 (n/2). Additionally, we prove that for any prime number n and integer r ≤ n/6, P(n, 3) ≤ (n − 1)! − n − 6r/√n2 − 8rn + 20r2 √(n − 1)!/n(n − r)!. This result greatly improves the upper bound of P(n, 3) for all primes n ≥ 37.
- 15 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (6) , 4156-4166
Improved Bounds on the Size of Permutation Codes Under Kendall τ -Metric
In order to overcome the challenges caused by flash memories and also to protect against errors related to reading information stored in DNA molecules in the shotgun sequencing method, the rank modulation method has been proposed. In the rank modulation framework, codewords are permutations. In this paper, we study the largest size P(n, d) of permutation codes of length n, i.e., subsets of the set Sn of all permutations on {1, ..., n} with the minimum distance at least d ∈ {1, ..., (n/2)} under the Kendall τ-metric. By presenting an algorithm and two theorems, we improve the known lower and upper bounds for P(n, d). In particular, we show that P(n, d) = 4 for all n ≥ 6 and 3/5 (n/2) < d ≤ 2/3 (n/2). Additionally, we prove that for any prime number n and integer r ≤ n/6, P(n, 3) ≤ (n − 1)! − n − 6r/√n2 − 8rn + 20r2 √(n − 1)!/n(n − r)!. This result greatly improves the upper bound of P(n, 3) for all primes n ≥ 37.
- 22 June 2023
- Published by Springer Nature in Cryptography and Communications
- p. 1-13
New upper bounds on the size of permutation codes under Kendall $\tau$-metric- 22 June 2023
- Published by Springer Nature in Cryptography and Communications
- p. 1-13
New upper bounds on the size of permutation codes under Kendall $\tau$-metric- 5 January 2022
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 90 (12) , 2841-2859
Equidistant permutation group codes
- 5 January 2022
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 90 (12) , 2841-2859
Equidistant permutation group codes