Javad Bagherian
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Javad Bagherian has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Reza Sobhani
Department of Applied Mathematics and Computer Science, Faculty of Mathematics and Statistics, University of Isfahan, Isfahan, Iran
11 shared publications - Alireza Abdollahi
Department of Pure Mathematics, Faculty of Mathematics and Statistics, University of Isfahan, Isfahan, Iran
10 shared publications - Maryam Khatami
Department of Pure Mathematics, Faculty of Mathematics and Statistics, University of Isfahan, Isfahan, Iran
10 shared publications - Farzad Parvaresh
Department of Electrical Engineering, Faculty of Engineering, University of Isfahan, Isfahan, Iran
5 shared publications - Fatemeh Jafari
Department of Pure Mathematics, Faculty of Mathematics and Statistics, University of Isfahan, Isfahan, Iran
4 shared publications - Amir Rahnamai Barghi
K. N. Toosi university of Technology University, Tehran-Iran
3 shared publications
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
- 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)\). - 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
- 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- Open Access
New Upper Bounds on the Size of Permutation Codes under Kendall $τ$-Metric
We first give two methods based on the representation theory of symmetric groups to study the largest size $P(n,d)$ of permutation codes of length $n$ i.e. subsets of the set $S_n$ all permutations on $\{1,\dots,n\}$ with the minimum distance (at least) $d$ under the Kendall $τ$-metric. The first method is an integer programming problem obtained from the transitive actions of $S_n$. The second method can be applied to refute the existence of perfect codes in $S_n$.\\ Here we reduce the known upper bound $(n-1)!-1$ for $P(n,3)$ to $(n-1)!-\lceil\frac{n}{3}\rceil+2\leq (n-1)!-2$, whenever $n\geq 11$ is any prime number. If $n=6$, $7$, $11$, $13$, $14$, $15$, $17$, the known upper bound for $P(n,3)$ is decreased by $3,3,9,11,1,1,4$, respectively.Open AccessNew Upper Bounds on the Size of Permutation Codes under Kendall $τ$-Metric
We first give two methods based on the representation theory of symmetric groups to study the largest size $P(n,d)$ of permutation codes of length $n$ i.e. subsets of the set $S_n$ all permutations on $\{1,\dots,n\}$ with the minimum distance (at least) $d$ under the Kendall $τ$-metric. The first method is an integer programming problem obtained from the transitive actions of $S_n$. The second method can be applied to refute the existence of perfect codes in $S_n$.\\ Here we reduce the known upper bound $(n-1)!-1$ for $P(n,3)$ to $(n-1)!-\lceil\frac{n}{3}\rceil+2\leq (n-1)!-2$, whenever $n\geq 11$ is any prime number. If $n=6$, $7$, $11$, $13$, $14$, $15$, $17$, the known upper bound for $P(n,3)$ is decreased by $3,3,9,11,1,1,4$, respectively. - 1 December 2022
- Published by Springer Nature in Bulletin of the Iranian Mathematical Society
- Vol. 48 (6) , 3809-3821
Groups with Sharp Character of Type {-1,1,3}
- 1 December 2022
- Published by Springer Nature in Bulletin of the Iranian Mathematical Society
- Vol. 48 (6) , 3809-3821
Groups with Sharp Character of Type {-1,1,3}
- 6 October 2022
- Published by Institute of Mathematics, Czech Academy of Sciences in Czechoslovak Mathematical Journal
- Vol. 72 (4) , 1081-1087
On sharp characters of type $\{ -1,0,2 \}$Institute of Mathematics of the Czech Academy of Sciences
- 6 October 2022
- Published by Institute of Mathematics, Czech Academy of Sciences in Czechoslovak Mathematical Journal
- Vol. 72 (4) , 1081-1087
On sharp characters of type $\{ -1,0,2 \}$Institute of Mathematics of the Czech Academy of Sciences
- 9 September 2022
- Published by Taylor & Francis in Communications in Algebra
- Vol. 51 (3) , 1011-1019
Groups with sharp non-linear irreducible characters
A complex character χ of a finite group G is called sharp if where . In this paper we give a characterization of finite groups all non-linear irreducible characters of which are sharp.- 9 September 2022
- Published by Taylor & Francis in Communications in Algebra
- Vol. 51 (3) , 1011-1019
Groups with sharp non-linear irreducible characters
A complex character χ of a finite group G is called sharp if where . In this paper we give a characterization of finite groups all non-linear irreducible characters of which are sharp.- 3 June 2022
- Published by Taylor & Francis in Communications in Algebra
- Vol. 50 (6) , 2731-2739
A conjecture of Cameron and Kiyota on sharp characters with prescribed values
Let chi be a virtual (generalized) character of a finite group G and L = L(chi) be the image of chi on G - {1}. The pair (G, chi) is said to be sharp of type L or L-sharp if vertical bar G vertical bar = Pi(l is an element of)(L)(chi(1) - I). If the principal character of G is not an irreducible constituent of y, the pair (G, chi) is called normalized. In this paper, we first provide some counterexamples to a conjecture that was proposed by Cameron and Kiyota in 1988. This conjecture states that if (G, chi) is L-sharp and vertical bar L vertical bar >= 2, then the inner product (chi,chi)(G) is uniquely determined by L. We then prove that this conjecture is true in the case that (G, chi) is normalized, chi is a character of G, and L contains at least an irrational value.
- 3 June 2022
- Published by Taylor & Francis in Communications in Algebra
- Vol. 50 (6) , 2731-2739
A conjecture of Cameron and Kiyota on sharp characters with prescribed values
Let chi be a virtual (generalized) character of a finite group G and L = L(chi) be the image of chi on G - {1}. The pair (G, chi) is said to be sharp of type L or L-sharp if vertical bar G vertical bar = Pi(l is an element of)(L)(chi(1) - I). If the principal character of G is not an irreducible constituent of y, the pair (G, chi) is called normalized. In this paper, we first provide some counterexamples to a conjecture that was proposed by Cameron and Kiyota in 1988. This conjecture states that if (G, chi) is L-sharp and vertical bar L vertical bar >= 2, then the inner product (chi,chi)(G) is uniquely determined by L. We then prove that this conjecture is true in the case that (G, chi) is normalized, chi is a character of G, and L contains at least an irrational value.