2 citations · 3 across the 10 of their papers we have counts for
6 papers · 1 filter
New Upper Bounds on the Size of Permutation Codes under Kendall -Metric
Alireza Abdollahi, Javad Bagherian, Fatemeh Jafari +3
We first give two methods based on the representation theory of symmetric groups to study the largest size of permutation codes of length i.e. subsets of the set …
New Bounds on the Size of Permutation Codes With Minimum Kendall -distance of Three
A. Abdollahi, J. Bagherian, F. Jafari +3
We study , the size of the largest subset of the set of all permutations with minimum Kendall -distance . Using a combination of group theory and integer progra…
The generalized X-join of Cayley graphs
Allen Herman, Javad Bagherian, Hanieh Memarzadeh
As a main result of this paper we give conditions under which the generalized -join of Cayley graphs is a Cayley graph. In particular, we show that -join of isomorphic Cayley…
On the wedge product of table algebras and applications to association schemes
Javad Bagherian
In this paper we will first present a generalization of the wedge product of association schemes to table algebras and give a necessary and sufficient condition for a table algebra…
Association schemes with at most two nonlinear irreducible characters and applications to finite groups
Javad Bagherian
An irreducible character of an association scheme is called nonlinear if the multiplicity of is greater than . The main result of this paper gives a characterization of…
On cyclotomic schemes over finite near-fields
J. Bagherian, Ilia Ponomarenko, A. Rahnamai Barghi
We introduce a concept of cyclotomic association scheme C over a finite near-field. It is proved that if C is nontrivial, then Aut(C)<AGL(V) where V is the linear space associated…