default search action
Koji Momihara
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j41]Koji Momihara, Sho Suda:
Strongly Regular Graphs from Pseudocyclic Association Schemes. Graphs Comb. 40(2): 39 (2024) - 2023
- [j40]Makoto Araya, Masaaki Harada, Koji Momihara:
Hadamard matrices related to a certain series of ternary self-dual codes. Des. Codes Cryptogr. 91(3): 795-805 (2023) - [j39]Hiroki Kajiura, Koji Momihara:
Difference sets in pseudocyclic association schemes. Discret. Math. 346(12): 113598 (2023) - 2022
- [j38]Koji Momihara:
Pure Gauss sums and skew Hadamard difference sets. Finite Fields Their Appl. 77: 101932 (2022) - [j37]Koji Momihara, Qing Xiang:
Cyclic arcs of Singer type and strongly regular Cayley graphs over finite fields. Finite Fields Their Appl. 77: 101953 (2022) - [i1]Makoto Araya, Masaaki Harada, Koji Momihara:
Hadamard matrices related to a certain series of ternary self-dual codes. CoRR abs/2205.15498 (2022) - 2021
- [j36]Ka Hin Leung, Koji Momihara, Qing Xiang:
A new family of Hadamard matrices of order 4(2q2+1). Discret. Math. 344(1): 112163 (2021) - [j35]Koji Momihara:
New constructions of strongly regular Cayley graphs on abelian non p-groups. J. Comb. Theory A 184: 105514 (2021) - 2020
- [j34]Koji Momihara:
A Recursive Construction for Skew Hadamard Difference Sets. Electron. J. Comb. 27(3): 3 (2020) - [j33]Koji Momihara, Qing Xiang:
Generalized constructions of Menon-Hadamard difference sets. Finite Fields Their Appl. 61 (2020) - [j32]Ka Hin Leung, Koji Momihara:
New constructions of Hadamard matrices. J. Comb. Theory A 171 (2020)
2010 – 2019
- 2019
- [j31]Koji Momihara, Qing Xiang:
Constructions of skew Hadamard difference families. Eur. J. Comb. 76: 73-81 (2019) - 2018
- [j30]John Bamberg
, Melissa Lee
A New Infinite Family of Hemisystems of the Hermitian Surface. Comb. 38(1): 43-66 (2018) - [j29]Koji Momihara:
Construction of strongly regular Cayley graphs based on three-valued Gauss periods. Eur. J. Comb. 70: 232-250 (2018) - [j28]Koji Momihara, Qing Xiang:
Strongly regular Cayley graphs from partitions of subdifference sets of the Singer difference sets. Finite Fields Their Appl. 50: 222-250 (2018) - 2017
- [j27]Koji Momihara:
Disjoint Difference Families from Galois Rings. Electron. J. Comb. 24(3): 3 (2017) - [j26]Miwako Mishima, Koji Momihara:
A new series of optimal tight conflict-avoiding codes of weight 3. Discret. Math. 340(4): 617-629 (2017) - [j25]Koji Momihara, Sho Suda:
Conference Matrices With Maximum Excess and Two-intersection Sets. Integers 17: A30 (2017) - [j24]Koji Momihara, Masashi Shinohara:
Distance Sets on Circles. Am. Math. Mon. 124(3): 241-254 (2017) - 2016
- [j23]Tao Feng
A family of m-ovoids of parabolic quadrics. J. Comb. Theory A 140: 97-111 (2016) - 2015
- [j22]Tao Feng
Constructions of strongly regular Cayley graphs and skew Hadamard difference sets from cyclotomic classes. Comb. 35(4): 413-434 (2015) - [j21]Koji Momihara, Yu Okumura:
New strongly regular decompositions of the complete graphs with prime power vertices. Finite Fields Their Appl. 36: 63-80 (2015) - [j20]Tao Feng
Cameron-Liebler line classes with parameter x=(q2-1)/2. J. Comb. Theory A 133: 307-338 (2015) - 2014
- [j19]Cuiling Fan, Koji Momihara:
Unified combinatorial constructions of optimal optical orthogonal codes. Adv. Math. Commun. 8(1): 53-66 (2014) - [j18]Koji Momihara, Mieko Yamada:
Divisible difference families from Galois rings GR(4, n) and Hadamard matrices. Des. Codes Cryptogr. 73(3): 897-909 (2014) - [j17]Koji Momihara:
Certain strongly regular Cayley graphs on 𝔽22(2s+1) from cyclotomy. Finite Fields Their Appl. 25: 280-292 (2014) - [j16]Koji Momihara, Qing Xiang:
Lifting constructions of strongly regular Cayley graphs. Finite Fields Their Appl. 26: 86-99 (2014) - 2013
- [j15]Koji Momihara:
Inequivalence of Skew Hadamard Difference Sets and Triple Intersection Numbers Modulo a Prime. Electron. J. Comb. 20(4): 35 (2013) - [j14]Koji Momihara:
Strongly regular Cayley graphs, skew Hadamard difference sets, and rationality of relative Gauss sums. Eur. J. Comb. 34(4): 706-723 (2013) - [j13]Koji Momihara:
Strongly regular Cayley graphs and rationality of relative Gauss sums. Electron. Notes Discret. Math. 40: 259-263 (2013) - [j12]Tao Feng
Three-class association schemes from cyclotomy. J. Comb. Theory A 120(6): 1202-1215 (2013) - [j11]Koji Momihara:
Skew Hadamard Difference Sets from Cyclotomic Strongly Regular Graphs. SIAM J. Discret. Math. 27(2): 1112-1122 (2013) - [j10]Tao Feng
Evaluation of the Weight Distribution of a Class of Cyclic Codes Based on Index 2 Gauss Sums. IEEE Trans. Inf. Theory 59(9): 5980-5984 (2013) - 2012
- [j9]Koji Momihara, Miwako Mishima, Masakazu Jimbo:
A decomposition of the 2-design formed by the planes in AG(2n, 3). Finite Fields Their Appl. 18(5): 956-970 (2012) - 2011
- [j8]Marco Buratti, Koji Momihara, Anita Pasotti
New results on optimal (v, 4, 2, 1) optical orthogonal codes. Des. Codes Cryptogr. 58(1): 89-109 (2011) - [j7]Koji Momihara:
New optimal optical orthogonal codes by restrictions to subgroups. Finite Fields Their Appl. 17(2): 166-182 (2011)
2000 – 2009
- 2009
- [j6]Koji Momihara:
Strong difference families, difference covers, and their applications for relative difference families. Des. Codes Cryptogr. 51(3): 253-273 (2009) - [j5]Ryoh Fuji-Hara, Koji Momihara, Mieko Yamada:
Perfect difference systems of sets and Jacobi sums. Discret. Math. 309(12): 3954-3961 (2009) - [j4]Koji Momihara:
On cyclic 2(k-1)-support (n, k)k-1 difference families. Finite Fields Their Appl. 15(4): 415-427 (2009) - [j3]Koji Momihara, Marco Buratti:
Bounds and Constructions of Optimal (n, 4, 2, 1) Optical Orthogonal Codes. IEEE Trans. Inf. Theory 55(2): 514-523 (2009) - 2007
- [j2]Koji Momihara:
Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three. Des. Codes Cryptogr. 45(3): 379-390 (2007) - [j1]Koji Momihara, Meinard Müller
Constant Weight Conflict-Avoiding Codes. SIAM J. Discret. Math. 21(4): 959-979 (2007) - [c1]Koji Momihara, Meinard Müller
Bounds and Constructions for Optimal Constant Weight Conflict-Avoiding Codes. ISIT 2007: 336-340
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 21:25 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: