default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHadi Kharaghani
Person information
- affiliation: University of Lethbridge, Department of Mathematics and Computer Science, AB, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j60]Hadi Kharaghani, Thomas Pender, Vladimir D. Tonchev:
On optimal constant weight codes derived from ømega-circulant balanced generalized weighing matrices. Des. Codes Cryptogr. 92(10): 2791-2799 (2024)- [j59]Makoto Araya, Masaaki Harada, Hadi Kharaghani, Ali Mohammadian, Behruz Tayfeh-Rezaie:
On the classification of skew Hadamard matrices of order $\varvec{36}$ and related structures. Des. Codes Cryptogr. 92(10): 3049-3062 (2024) - [j58]Masaaki Harada, Keita Ishizuka
, Hadi Kharaghani:
Ternary Extremal Four-Negacirculant Self-Dual Codes. Graphs Comb. 40(3): 59 (2024) - 2023
- [j57]Hadi Kharaghani, Sho Suda:
Hadamard Matrices related to Projective Planes. Electron. J. Comb. 30(2) (2023) - [j56]Hadi Kharaghani, Sho Suda, Vlad Zaitsev:
On a class of optimal constant weight ternary codes. Des. Codes Cryptogr. 91(1): 45-54 (2023) - [i1]Masaaki Harada, Keita Ishizuka, Hadi Kharaghani:
Ternary extremal four-negacirculant self-dual codes. CoRR abs/2306.10451 (2023) - 2022
- [j55]Hadi Kharaghani, Thomas Pender, Sho Suda:
A Family of Balanced Generalized Weighing Matrices. Comb. 42(6): 881-894 (2022) - [j54]Hadi Kharaghani, Thomas Pender, Sho Suda:
Quasi-balanced weighing matrices, signed strongly regular graphs and association schemes. Finite Fields Their Appl. 83: 102065 (2022) - [j53]Hadi Kharaghani, Thomas Pender, Sho Suda:
Balanced weighing matrices. J. Comb. Theory A 186: 105552 (2022) - 2021
- [j52]Hadi Kharaghani, Thomas Pender, Sho Suda:
Balancedly splittable orthogonal designs and equiangular tight frames. Des. Codes Cryptogr. 89(9): 2033-2050 (2021) - [j51]Hadi Kharaghani, Sho Suda:
Divisible design digraphs and association schemes. Finite Fields Their Appl. 69: 101763 (2021) - 2020
- [j50]Dean Crnkovic, Hadi Kharaghani, Andrea Svob:
Divisible design Cayley digraphs. Discret. Math. 343(4): 111784 (2020) - [j49]Hadi Kharaghani, Sho Suda:
Commutative association schemes obtained from twin prime powers, Fermat primes, Mersenne primes. Finite Fields Their Appl. 63: 101631 (2020)
2010 – 2019
- 2019
- [j48]Hadi Kharaghani, Sho Suda:
Linked systems of symmetric group divisible designs of type II. Des. Codes Cryptogr. 87(10): 2341-2360 (2019) - [j47]Hadi Kharaghani, Sho Suda:
Balancedly splittable Hadamard matrices. Discret. Math. 342(2): 546-561 (2019) - 2018
- [j46]Hadi Kharaghani, Sho Suda:
Unbiased orthogonal designs. Des. Codes Cryptogr. 86(7): 1573-1588 (2018) - [j45]Kai Fender, Hadi Kharaghani, Sho Suda:
On a class of quaternary complex Hadamard matrices. Discret. Math. 341(2): 421-426 (2018) - [j44]Hadi Kharaghani, Sho Suda:
Non-commutative association schemes and their fusion association schemes. Finite Fields Their Appl. 52: 108-125 (2018) - 2017
- [j43]Hadi Kharaghani, Sara Sasani, Sho Suda:
A strongly regular decomposition of the complete graph and its association scheme. Finite Fields Their Appl. 48: 356-370 (2017) - 2016
- [j42]Hadi Kharaghani, Sho Suda:
Symmetric Bush-type generalized Hadamard matrices and association schemes. Finite Fields Their Appl. 37: 72-84 (2016) - 2015
- [j41]Hadi Kharaghani, Sara Sasani, Sho Suda:
Mutually Unbiased Bush-type Hadamard Matrices and Association Schemes. Electron. J. Comb. 22(3): 3 (2015) - [j40]Darcy Best, Hadi Kharaghani, Hugh Ramp:
Mutually unbiased weighing matrices. Des. Codes Cryptogr. 76(2): 237-256 (2015) - 2014
- [j39]Ebrahim Ghaderpour, Hadi Kharaghani:
The asymptotic existence of orthogonal designs. Australas. J Comb. 58: 333-346 (2014) - 2013
- [j38]Darcy Best, Hadi Kharaghani, Hugh Ramp:
On unit weighing matrices with small weight. Discret. Math. 313(7): 855-864 (2013) - 2011
- [j37]Willem H. Haemers, Hadi Kharaghani, Maaike A. Meulenberg:
Divisible design graphs. J. Comb. Theory A 118(3): 978-992 (2011) - [p1]Hadi Kharaghani:
Unbiased Hadamard matrices and bases. Information Security, Coding Theory and Related Combinatorics 2011: 312-325 - 2010
- [j36]Darcy Best, Hadi Kharaghani:
Unbiased complex Hadamard matrices and bases. Cryptogr. Commun. 2(2): 199-209 (2010)
2000 – 2009
- 2009
- [j35]Jeffrey H. Dinitz, Hadi Kharaghani, Gholamreza B. Khosrovshahi, Shahriar Shahriari:
Preface. Discret. Math. 309(3): 513-514 (2009) - [j34]Warwick de Launey, Hadi Kharaghani:
On the asymptotic existence of cocyclic Hadamard matrices. J. Comb. Theory A 116(6): 1140-1153 (2009) - 2008
- [j33]Wolf H. Holzmann, Hadi Kharaghani, Behruz Tayfeh-Rezaie:
Williamson matrices up to order 59. Des. Codes Cryptogr. 46(3): 343-352 (2008) - [j32]Wolf H. Holzmann, Hadi Kharaghani, Behruz Tayfeh-Rezaie:
All triples for orthogonal designs of order 40. Discret. Math. 308(13): 2796-2801 (2008) - 2007
- [j31]Masaaki Harada, Wolf H. Holzmann, Hadi Kharaghani, M. Khorvash:
Extremal Ternary Self-Dual Codes Constructed from Negacirculant Matrices. Graphs Comb. 23(4): 401-417 (2007) - 2006
- [j30]Masaaki Harada, Hadi Kharaghani:
Orthogonal designs and MDS self-dual codes. Australas. J Comb. 35: 57-68 (2006) - [j29]Richard A. Brualdi, A. Samad Hedayat, Hadi Kharaghani, Gholamreza B. Khosrovshahi, Shahriar Shahriari:
Preface. Discret. Math. 306(23): 2989 (2006) - [j28]Majid Behbahani, Hadi Kharaghani:
On a new class of productive regular Hadamard matrices. Discret. Math. 306(23): 3042-3050 (2006) - 2005
- [j27]Yury J. Ionin, Hadi Kharaghani:
A Recursive Construction for New Symmetric Designs. Des. Codes Cryptogr. 35(3): 303-310 (2005) - [j26]Hadi Kharaghani, Alexander Rosa:
Preface. Discret. Math. 299(1-3): 1 (2005) - 2004
- [j25]Hadi Kharaghani, Behruz Tayfeh-Rezaie:
Some new orthogonal designs in orders 32 and 40. Discret. Math. 279(1-3): 317-324 (2004) - 2003
- [j24]Hadi Kharaghani:
On a Class of Symmetric Balanced Generalized Weighing Matrices. Des. Codes Cryptogr. 30(2): 139-149 (2003) - [j23]Hadi Kharaghani, Rouzbeh Torabi:
On a Decomposition of Complete Graphs. Graphs Comb. 19(4): 519-526 (2003) - [j22]Yury J. Ionin, Hadi Kharaghani:
Doubly regular digraphs and symmetric designs. J. Comb. Theory A 101(1): 35-48 (2003) - 2002
- [j21]Robert Craigen, Wolf H. Holzmann, Hadi Kharaghani:
Complex Golay sequences: structure and applications. Discret. Math. 252(1-3): 73-89 (2002) - [j20]Zvonimir Janko, Hadi Kharaghani:
A Block Negacyclic Bush-Type Hadamard Matrix and Two Strongly Regular Graphs. J. Comb. Theory A 98(1): 118-126 (2002) - 2001
- [j19]Anthony Bonato, Wolf H. Holzmann, Hadi Kharaghani:
Hadamard Matrices and Strongly Regular Graphs with the 3-e.c. Adjacency Property. Electron. J. Comb. 8(1) (2001) - [j18]Zvonimir Janko, Hadi Kharaghani, Vladimir D. Tonchev:
The Existence of a Bush-Type Hadamard Matrix of Order 324 and Two New Infinite Classes of Symmetric Designs. Des. Codes Cryptogr. 24(2): 225-232 (2001) - 2000
- [j17]Wolf H. Holzmann, Hadi Kharaghani:
On the Plotkin arrays. Australas. J Comb. 22: 287-300 (2000) - [j16]Hadi Kharaghani:
On the Twin Designs with the Ionin-type Parameters. Electron. J. Comb. 7 (2000) - [j15]Charles J. Colbourn, Hadi Kharaghani:
Coding, Cryptography, and Computer Security - Preface. Discret. Appl. Math. 102(1-2): 1 (2000) - [j14]Wolf H. Holzmann, Hadi Kharaghani:
On the orthogonal designs of order 24. Discret. Appl. Math. 102(1-2): 103-114 (2000)
1990 – 1999
- 1998
- [j13]F. Kamali, Hadi Kharaghani:
Dihedral Golay sequences. Australas. J Comb. 18: 139-146 (1998) - [j12]Wolf H. Holzmann, Hadi Kharaghani:
A D-optimal design of order 150. Discret. Math. 190(1-3): 265-269 (1998) - 1997
- [j11]Robert Craigen, Hadi Kharaghani:
Hadamard Matrices from Weighing Matrices via Signed Groups. Des. Codes Cryptogr. 12(1): 49-58 (1997) - 1996
- [j10]Robert Craigen, Hadi Kharaghani:
A combined approach to the construction of Hadamard matrices. Australas. J Comb. 13: 89-108 (1996) - 1994
- [j9]Hadi Kharaghani:
On the asymptotic existence of complex Williamson Hadamard matrices. Australas. J Comb. 10: 225-230 (1994) - [j8]Wolf H. Holzmann, Hadi Kharaghani:
A computer search for complex Golay sequences. Australas. J Comb. 10: 251-258 (1994) - 1993
- [j7]Robert Craigen, Hadi Kharaghani:
On the nonexistence of Hermitian circulant complex Hadamard matrices. Australas. J Comb. 7: 225-228 (1993) - [j6]Hadi Kharaghani:
A construction for Hadamard matrices. Discret. Math. 120(1-3): 115-120 (1993) - [j5]Hadi Kharaghani, Jennifer Seberry:
The excess of complex Hadamard matrices. Graphs Comb. 9(1): 47-56 (1993) - 1992
- [j4]Hadi Kharaghani:
Block Golay sequences with applications. Australas. J Comb. 6: 293- (1992) - 1991
- [j3]Hadi Kharaghani:
An infinite class of Hadamard matrices of maximal excess. Discret. Math. 89(3): 307-312 (1991)
1980 – 1989
- 1987
- [j2]Hadi Kharaghani:
A construction of D-optimal designs for N equiv 2 mod 4. J. Comb. Theory A 46(1): 156-158 (1987) - 1985
- [j1]Hadi Kharaghani:
New Proof of a Theorem of Szekeres. J. Comb. Theory A 40(1): 169-170 (1985)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-02 21:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
