Zobrazeno 1 - 10
of 75
pro vyhledávání: '"Hadi Kharaghani"'
Publikováno v:
Journal of Algebraic Combinatorics. 55:27-41
The notion of disjoint weighing matrices is introduced as a generalization of orthogonal designs. A recursive construction along with a computer search lead to some infinite classes of disjoint weighing matrices, which in turn are shown to form commu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::42e668a31cac23b11f290e94f78a84ca
https://doi.org/10.1007/s10801-020-00981-0
https://doi.org/10.1007/s10801-020-00981-0
Publikováno v:
Journal of Combinatorial Designs. 28:421-427
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d79f09ef4fb68e1281e7fda5bad39fc4
https://doi.org/10.1002/jcd.21706
https://doi.org/10.1002/jcd.21706
A weighing matrix $W$ is quasi-balanced if $|W||W|^\top=|W|^\top|W|$ has at most two off-diagonal entries, where $|W|_{ij}=|W_{ij}|$. A quasi-balanced weighing matrix $W$ signs a strongly regular graph if $|W|$ coincides with its adjacency matrix. Am
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::625a7151d2facca6b3e40c6e6a18a236
http://arxiv.org/abs/2202.01369
http://arxiv.org/abs/2202.01369
A weighing matrix $W$ of order $n=\frac{p^{m+1}-1}{p-1}$ and weight $p^m$ is constructed and shown that the rows of $W$ and $-W$ form optimal constant weight ternary codes of length $n$, weight $p^m$ and minimum distance $p^{m-1}(\frac{p+3}{2})$ for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d520cba7735da368deeea587f90adbf0
http://arxiv.org/abs/2109.14995
http://arxiv.org/abs/2109.14995
A unified approach to the construction of weighing matrices and certain symmetric designs is presented. Assuming the weight $p$ in a weighing matrix $W(n,p)$ is a prime power, it is shown that there is a $$W\left(\frac{p^{m+1}-1}{p-1}(n-1)+1,p^{m+1}\
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5d764d9f621514a7d7be9c76d3c42e08
http://arxiv.org/abs/2108.12593
http://arxiv.org/abs/2108.12593
Autor:
Hadi Kharaghani, Sho Suda
Publikováno v:
Designs, Codes and Cryptography. 87:2341-2360
Linked systems of symmetric group divisible designs of type II are introduced, and several examples are obtained from affine resolvable designs and a variant of mutually orthogonal Latin squares. Furthermore, an equivalence between such symmetric gro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d0665ce229c1036e26eda97d1451e306
https://doi.org/10.1007/s10623-019-00622-z
https://doi.org/10.1007/s10623-019-00622-z
The concept of balancedly splittable orthogonal designs is introduced along with a recursive construction. As an application, equiangular tight frames over the real, complex, and quaternions meeting the Delsarte-Goethals-Seidel upper bound is obtaine
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::74e0b458505fa5b0373e1fed690ca769
Autor:
Sho Suda, Hadi Kharaghani
Divisible design digraphs are constructed from skew balanced generalized weighing matrices and generalized Hadamard matrices. Commutative and non-commutative association schemes are shown to be attached to the constructed divisible design digraphs.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bff1b7a0fe926a940ffe44840f21e191
http://arxiv.org/abs/2004.00510
http://arxiv.org/abs/2004.00510
Publikováno v:
Finite Fields and Their Applications. 48:356-370
For any positive integer m, the complete graph on 2 2 m ( 2 m + 2 ) vertices is decomposed into 2 m + 1 commuting strongly regular graphs, which give rise to a symmetric association scheme of class 2 m + 2 − 2 . Furthermore, the eigenmatrices of th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b7f21bf444d271b199db03cc9290014a
https://doi.org/10.1016/j.ffa.2017.08.012
https://doi.org/10.1016/j.ffa.2017.08.012
Autor:
Hadi Kharaghani, Sho Suda
Publikováno v:
Journal of Algebraic Combinatorics. 47:319-343
We introduce the concept of linked systems of symmetric group divisible designs. The connection with association schemes is established, and as a consequence we obtain an upper bound on the number of symmetric group divisible designs which are linked
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e1d211fb6ff55c9ac07660a55839c763
https://doi.org/10.1007/s10801-017-0777-z
https://doi.org/10.1007/s10801-017-0777-z