default search action
Sho Suda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j36]Alexander L. Gavrilyuk, Sho Suda
:
Uniqueness of an association scheme related to the Witt design on 11 points. Des. Codes Cryptogr. 92(1): 205-209 (2024) - [j35]Koji Momihara, Sho Suda:
Strongly Regular Graphs from Pseudocyclic Association Schemes. Graphs Comb. 40(2): 39 (2024) - 2023
- [j34]Hadi Kharaghani, Sho Suda:
Hadamard Matrices related to Projective Planes. Electron. J. Comb. 30(2) (2023) - [j33]Hadi Kharaghani
On a class of optimal constant weight ternary codes. Des. Codes Cryptogr. 91(1): 45-54 (2023) - [j32]Sho Kubota
Mutually Orthogonal Sudoku Latin Squares and Their Graphs. Graphs Comb. 39(6): 122 (2023) - 2022
- [j31]Hadi Kharaghani, Thomas Pender, Sho Suda:
A Family of Balanced Generalized Weighing Matrices. Comb. 42(6): 881-894 (2022) - [j30]Hadi Kharaghani, Thomas Pender, Sho Suda
Quasi-balanced weighing matrices, signed strongly regular graphs and association schemes. Finite Fields Their Appl. 83: 102065 (2022) - [j29]Hadi Kharaghani
Balanced weighing matrices. J. Comb. Theory A 186: 105552 (2022) - 2021
- [j28]Hadi Kharaghani, Thomas Pender, Sho Suda
Balancedly splittable orthogonal designs and equiangular tight frames. Des. Codes Cryptogr. 89(9): 2033-2050 (2021) - [j27]Hadi Kharaghani, Sho Suda:
Divisible design digraphs and association schemes. Finite Fields Their Appl. 69: 101763 (2021) - 2020
- [j26]Alexander L. Gavrilyuk, Sho Suda, Janos Vidali
On Tight 4-Designs in Hamming Association Schemes. Comb. 40(3): 345-362 (2020) - [j25]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
- [j24]Hadi Kharaghani, Sho Suda
Linked systems of symmetric group divisible designs of type II. Des. Codes Cryptogr. 87(10): 2341-2360 (2019) - [j23]Hadi Kharaghani
Balancedly splittable Hadamard matrices. Discret. Math. 342(2): 546-561 (2019) - 2018
- [j22]Hadi Kharaghani
Unbiased orthogonal designs. Des. Codes Cryptogr. 86(7): 1573-1588 (2018) - [j21]Hiroshi Nozaki, Sho Suda:
Complex Spherical Codes with Three Inner Products. Discret. Comput. Geom. 60(2): 294-317 (2018) - [j20]Kai Fender, Hadi Kharaghani
On a class of quaternary complex Hadamard matrices. Discret. Math. 341(2): 421-426 (2018) - [j19]Hadi Kharaghani
Non-commutative association schemes and their fusion association schemes. Finite Fields Their Appl. 52: 108-125 (2018) - 2017
- [j18]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) - [j17]Koji Momihara, Sho Suda:
Conference Matrices With Maximum Excess and Two-intersection Sets. Integers 17: A30 (2017) - [j16]Makoto Araya, Masaaki Harada, Sho Suda:
Quasi-unbiased Hadamard matrices and weakly unbiased Hadamard matrices: A coding-theoretic approach. Math. Comput. 86(304): 951-984 (2017) - [j15]Sho Suda, Hajime Tanaka
A semidefinite programming approach to a cross-intersection problem with measures. Math. Program. 166(1-2): 113-130 (2017) - 2016
- [j14]Makoto Araya, Masaaki Harada, Sho Suda:
Supplementary difference sets related to a certain class of complex spherical 2-codes. Australas. J Comb. 65: 71-83 (2016) - [j13]Masaaki Harada, Sho Suda:
On binary codes related to mutually quasi-unbiased weighing matrices. Australas. J Comb. 66: 10-22 (2016) - [j12]Sho Suda:
A two-fold cover of strongly regular graphs with spreads and association schemes of class five. Des. Codes Cryptogr. 78(2): 463-471 (2016) - [j11]Hiroshi Nozaki, Sho Suda:
Complex spherical codes with two inner products. Eur. J. Comb. 51: 511-518 (2016) - [j10]Hadi Kharaghani
Symmetric Bush-type generalized Hadamard matrices and association schemes. Finite Fields Their Appl. 37: 72-84 (2016) - 2015
- [j9]Sho Suda:
Characterizations of Regularity for certain $Q$-Polynomial Association Schemes. Electron. J. Comb. 22(1): 1 (2015) - [j8]Hadi Kharaghani, Sara Sasani, Sho Suda:
Mutually Unbiased Bush-type Hadamard Matrices and Association Schemes. Electron. J. Comb. 22(3): 3 (2015) - [j7]Eiichi Bannai, Etsuko Bannai, Sho Suda, Hajime Tanaka:
On Relative $t$-Designs in Polynomial Association Schemes. Electron. J. Comb. 22(4): 4 (2015) - 2012
- [j6]Sho Suda:
On Q-Polynomial Association Schemes of Small Class. Electron. J. Comb. 19(1): 68 (2012) - [j5]Sho Suda:
A generalization of the Erdős-Ko-Rado theorem to t-designs in certain semilattices. Discret. Math. 312(10): 1827-1831 (2012) - [j4]Sho Suda:
New parameters of subsets in polynomial association schemes. J. Comb. Theory A 119(1): 117-134 (2012) - 2011
- [j3]Hiroshi Nozaki, Sho Suda:
Bounds on s-Distance Sets with Strength t. SIAM J. Discret. Math. 25(4): 1699-1713 (2011) - 2010
- [j2]Sho Suda:
Coherent configurations and triply regular association schemes obtained from spherical designs. J. Comb. Theory A 117(8): 1178-1194 (2010)
2000 – 2009
- 2009
- [j1]Kanat S. Abdukhalikov
Association schemes related to universally optimal configurations, Kerdock codes and extremal Euclidean line-sets. J. Comb. Theory A 116(2): 434-448 (2009)
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-06-10 20:31 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: