Reza Sobhani
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Reza Sobhani has a total of 34 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
14 shared publications - Maryam Khatami
Department of Pure Mathematics, Faculty of Mathematics and Statistics, University of Isfahan, Isfahan, Iran
12 shared publications - Javad Bagherian
Department of Pure Mathematics, Faculty of Mathematics and Statistics, University of Isfahan, Isfahan, Iran
11 shared publications - Farzad Parvaresh
Department of Electrical Engineering, Faculty of Engineering, University of Isfahan, Isfahan, Iran
7 shared publications - Fatemeh Jafari
Department of Pure Mathematics, Faculty of Mathematics and Statistics, University of Isfahan, Isfahan, Iran
5 shared publications - Mahdi Ebrahimi
SCHOOL OF MATHEMATICS, INSTITUTE FOR RESEARCH IN FUNDAMENTAL SCIENCES (IPM), TEHRAN, IRAN
3 shared publications
Latest Publications
- 29 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. PP (00189448) , 1
On Enumerating Feasible Permutations for Rank Modulation Codes in DNA storage via Hyperplane Arrangements
For a directed graph G with edge set {1, 2, . . . , k}, a feasible permutations for G is a permutation π on {1, 2, . . . , k} such that there exists an injective weight function p : {1, 2, . . . , k} → Z+ for which the sum of the weights of all incoming edges equals the sum of the weights of all outgoing edges at every vertex of G, provided that if p(i1) < p(i2) < · · · < p(ik), then π(it) = t for every t ∈ {1, . . . , k}. In this paper, we study the number of feasible permutations (denoted by Fq,ℓ) for the De Bruijn graph Gq,ℓ−1 , where q > 2 is the size of the alphabet. In the case q = 4, the corresponding De Bruijn graph is used in DNA data storage. To enumerate these feasible permutations, we establish a connection between feasible permutations and regions in a special hyperplane arrangement, denoted by A. Using Zaslavsky’s formula, we present some numerical results and obtain the exact number of F3,2 and F4,2. Since the formula becomes complicated for larger values of q and ℓ, we concentrate on the case ℓ = 2 and then by counting the regions in a hyperplane sub-arrangement of A, we provide a lower bound on Fq,2. We compare our bound with the latest lower bound on Fq,2 and show that our bound is Ω(q3J(q)) while the previous one is Ω(q2J(q)), where J(q) = (q2 −2q +1)!(q2)!/(q2 −q)!.
- 29 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. PP (00189448) , 1
On Enumerating Feasible Permutations for Rank Modulation Codes in DNA storage via Hyperplane Arrangements
For a directed graph G with edge set {1, 2, . . . , k}, a feasible permutations for G is a permutation π on {1, 2, . . . , k} such that there exists an injective weight function p : {1, 2, . . . , k} → Z+ for which the sum of the weights of all incoming edges equals the sum of the weights of all outgoing edges at every vertex of G, provided that if p(i1) < p(i2) < · · · < p(ik), then π(it) = t for every t ∈ {1, . . . , k}. In this paper, we study the number of feasible permutations (denoted by Fq,ℓ) for the De Bruijn graph Gq,ℓ−1 , where q > 2 is the size of the alphabet. In the case q = 4, the corresponding De Bruijn graph is used in DNA data storage. To enumerate these feasible permutations, we establish a connection between feasible permutations and regions in a special hyperplane arrangement, denoted by A. Using Zaslavsky’s formula, we present some numerical results and obtain the exact number of F3,2 and F4,2. Since the formula becomes complicated for larger values of q and ℓ, we concentrate on the case ℓ = 2 and then by counting the regions in a hyperplane sub-arrangement of A, we provide a lower bound on Fq,2. We compare our bound with the latest lower bound on Fq,2 and show that our bound is Ω(q3J(q)) while the previous one is Ω(q2J(q)), where J(q) = (q2 −2q +1)!(q2)!/(q2 −q)!.
- 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
- Open Access
The Sequence Reconstruction of Permutations under Hamming Metric with Small Errors
The sequence reconstruction problem asks for the recovery of a sequence from multiple noisy copies, where each copy may contain up to $r$ errors. In the case of permutations on \(n\) letters under the Hamming metric, this problem is closely related to the parameter $N(n,r)$, the maximum intersection size of two Hamming balls of radius $r$. While previous work has resolved \(N(n,r)\) for small radii (\(r \leq 4\)) and established asymptotic bounds for larger \(r\), we present new exact formulas for \(r \in \{5,6,7\}\) using group action techniques. In addition, we develop a formula for \(N(n,r)\) based on the irreducible characters of the symmetric group \(S_n\), along with an algorithm that enables computation of \(N(n,r)\) for larger parameters, including cases such as \(N(43,8)\) and \(N(24,14)\).Open AccessThe Sequence Reconstruction of Permutations under Hamming Metric with Small Errors
The sequence reconstruction problem asks for the recovery of a sequence from multiple noisy copies, where each copy may contain up to $r$ errors. In the case of permutations on \(n\) letters under the Hamming metric, this problem is closely related to the parameter $N(n,r)$, the maximum intersection size of two Hamming balls of radius $r$. While previous work has resolved \(N(n,r)\) for small radii (\(r \leq 4\)) and established asymptotic bounds for larger \(r\), we present new exact formulas for \(r \in \{5,6,7\}\) using group action techniques. In addition, we develop a formula for \(N(n,r)\) based on the irreducible characters of the symmetric group \(S_n\), along with an algorithm that enables computation of \(N(n,r)\) for larger parameters, including cases such as \(N(43,8)\) and \(N(24,14)\). - Open Access
- 10 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 159412-159421
A New Lower Bound for Permutation Codes Using Reed–Solomon Codes
We present a constructive lower bound for permutation codes under Kendall’s$\tau $ -metric that improves upon the classical Gilbert-Varshamov estimate for many parameters. For any length$p \gt 5$ , we construct codes with minimum Kendall’s$\tau $ -distance 6 and size at least$p! / p^{3}$ . This result is achieved by proving that Reed-Solomon codes of length p and dimension$p-3$ have a minimum Lee distance of 6, and then applying a metric embedding from the Lee metric to the Kendall’s$\tau $ -metric.- 10 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 159412-159421
Open AccessA New Lower Bound for Permutation Codes Using Reed–Solomon Codes
We present a constructive lower bound for permutation codes under Kendall’s$\tau $ -metric that improves upon the classical Gilbert-Varshamov estimate for many parameters. For any length$p \gt 5$ , we construct codes with minimum Kendall’s$\tau $ -distance 6 and size at least$p! / p^{3}$ . This result is achieved by proving that Reed-Solomon codes of length p and dimension$p-3$ have a minimum Lee distance of 6, and then applying a metric embedding from the Lee metric to the Kendall’s$\tau $ -metric. - 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.
- Open Access
- 20 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 15339-15345
More on Codes Over Finite Quotients of Polynomial Rings
Let q = pr be a prime power, Fq be the finite field of order q and f (x) be a monic polynomial in Fq[x]. Set A := Fq[x]/⟨f (x)⟩. In this paper we continue the study (started by T. P. Berger and N. El Amrani) of A-codes of length l over A, i.e. A-submodules of Al. We introduce two types of unique generating sets, called type I and type II basis of divisors, for an A-code. Using this, we present a building-up construction so that one can obtain all distinct A-codes of length l, with their basis of divisors. We complete the classification for the special case l = 2 and enumerate all the A-codes of length 2. As an example, we list all binary index-2 quasi-cyclic codes of lengths 16 and 32, and all ternary index-2 quasi-cyclic codes of lengths 6 and 18, which are best-known codes.
- 20 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 15339-15345
Open AccessMore on Codes Over Finite Quotients of Polynomial Rings
Let q = pr be a prime power, Fq be the finite field of order q and f (x) be a monic polynomial in Fq[x]. Set A := Fq[x]/⟨f (x)⟩. In this paper we continue the study (started by T. P. Berger and N. El Amrani) of A-codes of length l over A, i.e. A-submodules of Al. We introduce two types of unique generating sets, called type I and type II basis of divisors, for an A-code. Using this, we present a building-up construction so that one can obtain all distinct A-codes of length l, with their basis of divisors. We complete the classification for the special case l = 2 and enumerate all the A-codes of length 2. As an example, we list all binary index-2 quasi-cyclic codes of lengths 16 and 32, and all ternary index-2 quasi-cyclic codes of lengths 6 and 18, which are best-known codes.
- Open Access
- 2 October 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (1)
On the structure of repeated-root polycyclic codes over local rings
- 2 October 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (1)
Open AccessOn the structure of repeated-root polycyclic codes over local rings
- 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