Hadi Kharaghani
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
Hadi Kharaghani has a total of 39 co-authors. Here are the top co-authors by number of shared publications:
- Sho Suda
Department of Mathematics, National Defense Academy of Japan, Yokosuka, Japan
41 shared publications - Behruz Tayfeh-Rezaie
School of Mathematics Institute for Research in Fundamental Sciences (IPM) P.O. Box 19395 -5746 Tehran Iran
7 shared publications - Masaaki Harada
Research Center for Pure and Applied Mathematics, Graduate School of Information Sciences, Tohoku University, Sendai, Japan
6 shared publications - Thomas Pender
Department of Mathematics and Computer Science University of Lethbridge T1K 3M4 Lethbridge Alberta Canada
5 shared publications - Darcy Best
University of Lethbridge
4 shared publications - Vlad Zaitsev
Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, Canada
4 shared publications
Latest Publications
- 27 August 2026
- Published by Springer Nature in Cryptography and Communications
- Vol. 18 (6) , 2429-2442
A generalisation of bent vectors for Butson Hadamard matrices
- 27 August 2026
- Published by Springer Nature in Cryptography and Communications
- Vol. 18 (6) , 2429-2442
A generalisation of bent vectors for Butson Hadamard matrices
- 24 January 2026
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 63 (1) , 12
On skew-regular Hadamard matrices
- 24 January 2026
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 63 (1) , 12
On skew-regular Hadamard matrices
- Open Access
- 20 January 2026
- Published by Wiley in Journal of Combinatorial Designs
- Vol. 34 (5) , 215-227
On Regular Quaternary Hadamard Matrices
Through the use of regularizing vectors, all regular quaternary Hadamard matrices of orders 10 and 18 have been successfully identified. Of these, two matrices of order 10 and 184 matrices of order 18 were found to have unbiased mates. Converting the quaternary Hadamard matrices of order 18 to real Hadamard matrices, the study uncovered that six matrices of order 36 having unbiased pairs were connected to the extremal Pless symmetry code. Furthermore, the study uncovered exactly 28 nonregular quaternary Hadamard matrices of order 18, providing the first examples of nonregular Hadamard matrices of order 36 and, as a result, settling a recent conjecture in the negative.
- 20 January 2026
- Published by Wiley in Journal of Combinatorial Designs
- Vol. 34 (5) , 215-227
Open AccessOn Regular Quaternary Hadamard Matrices
Through the use of regularizing vectors, all regular quaternary Hadamard matrices of orders 10 and 18 have been successfully identified. Of these, two matrices of order 10 and 184 matrices of order 18 were found to have unbiased mates. Converting the quaternary Hadamard matrices of order 18 to real Hadamard matrices, the study uncovered that six matrices of order 36 having unbiased pairs were connected to the extremal Pless symmetry code. Furthermore, the study uncovered exactly 28 nonregular quaternary Hadamard matrices of order 18, providing the first examples of nonregular Hadamard matrices of order 36 and, as a result, settling a recent conjecture in the negative.
- Open Access
- 28 June 2025
- Published by Springer Nature in Designs, Codes and Cryptography
- p. 1-39
Unbiased weighing matrices of weight 9
We investigate unbiased weighing matrices of weight 9 and provide a construction method using mutually suitable Latin squares. For $$n \le 16$$ , we determine the maximum size among sets of mutually unbiased weighing matrices of order n and weight 9. Notably, our findings reveal that 13 is the smallest order where such pairs exist, and 16 is the first order for which a maximum class of unbiased weighing matrices is found.- 28 June 2025
- Published by Springer Nature in Designs, Codes and Cryptography
- p. 1-39
Open AccessUnbiased weighing matrices of weight 9
We investigate unbiased weighing matrices of weight 9 and provide a construction method using mutually suitable Latin squares. For $$n \le 16$$ , we determine the maximum size among sets of mutually unbiased weighing matrices of order n and weight 9. Notably, our findings reveal that 13 is the smallest order where such pairs exist, and 16 is the first order for which a maximum class of unbiased weighing matrices is found. - 21 March 2025
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 41 (2) , 1-10
Unbiased Hadamard Matrices and Ternary Self-dual Codes
- 21 March 2025
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 41 (2) , 1-10
Unbiased Hadamard Matrices and Ternary Self-dual Codes
- Open Access
Constructions of self-orthogonal and LCD subspace codes
Recently, the notions of self-orthogonal subspace codes and LCD subspace codes were introduced, and LCD subspace codes obtained from mutually unbiased weighing matrices were studied. In this paper, we provide a method of constructing self-orthogonal and LCD subspace codes from a set of matrices under certain conditions. In particular, we give constructions of self-orthogonal and LCD subspace codes from mutually quasi-unbiased weighing matrices, linked systems of symmetric designs, and linked systems of symmetric group divisible designs, Deza graphs and their equitable partitions.
Open AccessConstructions of self-orthogonal and LCD subspace codes
Recently, the notions of self-orthogonal subspace codes and LCD subspace codes were introduced, and LCD subspace codes obtained from mutually unbiased weighing matrices were studied. In this paper, we provide a method of constructing self-orthogonal and LCD subspace codes from a set of matrices under certain conditions. In particular, we give constructions of self-orthogonal and LCD subspace codes from mutually quasi-unbiased weighing matrices, linked systems of symmetric designs, and linked systems of symmetric group divisible designs, Deza graphs and their equitable partitions.
- 7 June 2024
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 92 (10) , 3049-3062
On the classification of skew Hadamard matrices of order $\varvec{36}$ and related structures- 7 June 2024
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 92 (10) , 3049-3062
On the classification of skew Hadamard matrices of order $\varvec{36}$ and related structures- 15 May 2024
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 92 (10) , 1-9
On optimal constant weight codes derived from $\omega $-circulant balanced generalized weighing matrices- 15 May 2024
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 92 (10) , 1-9
On optimal constant weight codes derived from $\omega $-circulant balanced generalized weighing matrices- 2 May 2024
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 40 (3) , 1-8
Ternary Extremal Four-Negacirculant Self-Dual Codes
- 2 May 2024
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 40 (3) , 1-8
Ternary Extremal Four-Negacirculant Self-Dual Codes
- Open Access
On the classification of skew Hadamard matrices of order 36 and related structures
Two skew Hadamard matrices are considered {\sf SH}-equivalent if they are similar by a signed permutation matrix. This paper determines the number of {\sf SH}-inequivalent skew Hadamard matrices of order $36$ for some types. We also study ternary self-dual codes and association schemes constructed from the skew Hadamard matrices of order $36$.Open AccessOn the classification of skew Hadamard matrices of order 36 and related structures
Two skew Hadamard matrices are considered {\sf SH}-equivalent if they are similar by a signed permutation matrix. This paper determines the number of {\sf SH}-inequivalent skew Hadamard matrices of order $36$ for some types. We also study ternary self-dual codes and association schemes constructed from the skew Hadamard matrices of order $36$.