default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRyoh Fuji-Hara
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j22]Shoko Chisaki
, Ryoh Fuji-Hara, Nobuko Miyamoto:
A construction for circulant type dropout designs. Des. Codes Cryptogr. 89(8): 1839-1852 (2021)
2010 – 2019
- 2015
- [j21]Ryoh Fuji-Hara:
Perfect hash families of strength three with three rows from varieties on finite projective geometries. Des. Codes Cryptogr. 77(2-3): 351-356 (2015) - 2012
- [j20]Dianhua Wu, Qing Shu, Ryoh Fuji-Hara, Desheng Li, Shuming Chen:
The existence of doubly disjoint (mt+1, m, m-1) difference families. Ars Comb. 104: 197-209 (2012) - 2011
- [p1]Ryoh Fuji-Hara, Ying Miao:
Multi-structured designs and their applications. Information Security, Coding Theory and Related Combinatorics 2011: 326-362
2000 – 2009
- 2009
- [j19]Ryoh Fuji-Hara, Koji Momihara, Mieko Yamada:
Perfect difference systems of sets and Jacobi sums. Discret. Math. 309(12): 3954-3961 (2009) - [j18]Cunsheng Ding, Ryoh Fuji-Hara, Yuichiro Fujiwara, Masakazu Jimbo, Miwako Mishima:
Sets of frequency hopping sequences: bounds and optimal constructions. IEEE Trans. Inf. Theory 55(7): 3297-3304 (2009) - 2008
- [j17]Ryoh Fuji-Hara, Xiyang Li, Ying Miao, Dianhua Wu:
A TWOOA construction for multi-receiver multi-message authentication codes. J. Math. Cryptol. 2(1): 9-28 (2008) - 2006
- [j16]Ryoh Fuji-Hara, Akihiro Munemasa, Vladimir D. Tonchev:
Hyperplane partitions and difference systems of sets. J. Comb. Theory A 113(8): 1689-1698 (2006) - [j15]Gennian Ge, Ryoh Fuji-Hara, Ying Miao:
Further combinatorial constructions for optimal frequency-hopping sequences. J. Comb. Theory A 113(8): 1699-1718 (2006) - 2004
- [j14]Ryoh Fuji-Hara, Ying Miao, Miwako Mishima:
Optimal frequency hopping sequences: a combinatorial approach. IEEE Trans. Inf. Theory 50(10): 2408-2420 (2004) - 2003
- [j13]Yejing Wang, Jennifer Seberry, Reihaneh Safavi-Naini, Ryoh Fuji-Hara:
A Note on the Exposure Property of SBIBD. Electron. Notes Discret. Math. 15: 225-227 (2003) - [j12]Yanxun Chang, Ryoh Fuji-Hara, Ying Miao:
Combinatorial constructions of optimal optical orthogonal codes with weight 4. IEEE Trans. Inf. Theory 49(5): 1283-1292 (2003) - 2002
- [j11]Ryoh Fuji-Hara, Ying Miao:
A Note on Geometric Structures of Linear Ordered Orthogonal Arrays and (T, M, S)-Nets of Low Strength. Des. Codes Cryptogr. 26(1-3): 257-263 (2002) - [j10]Ryoh Fuji-Hara, Sanpei Kageyama, Shinya Kuriki, Ying Miao, Shigenobu Shinohara:
Balanced nested designs and balanced arrays. Discret. Math. 259(1-3): 91-119 (2002) - 2001
- [j9]Ryoh Fuji-Hara, Ying Miao, Jianxing Yin:
Optimal (9v, 4, 1) Optical Orthogonal Codes. SIAM J. Discret. Math. 14(2): 256-266 (2001) - 2000
- [j8]Ryoh Fuji-Hara, Ying Miao:
Optical orthogonal codes: Their bounds and new optimal constructions. IEEE Trans. Inf. Theory 46(7): 2396-2406 (2000)
1990 – 1999
- 1991
- [j7]Ryoh Fuji-Hara, Shinya Kuriki:
Mutually balanced nested designs. Discret. Math. 97(1-3): 167-176 (1991) - 1990
- [j6]Masakazu Jimbo, Ryoh Fuji-Hara:
Optimal authentication systems and combinatorial designs. IEEE Trans. Inf. Theory 36(1): 54-62 (1990)
1980 – 1989
- 1989
- [j5]Ryoh Fuji-Hara, Shinya Kuriki, Masakazu Jimbo:
On balanced complementation for regular t-wise balanced designs. Discret. Math. 76(1): 29-35 (1989) - 1988
- [j4]Ryoh Fuji-Hara, Scott A. Vanstone:
Hyperplane skew resolutions and their applications. J. Comb. Theory A 47(1): 134-144 (1988) - 1987
- [j3]Ryoh Fuji-Hara, Scott A. Vanstone:
The existence of orthogonal resolutions of lines in AG(n, q). J. Comb. Theory A 45(1): 139-147 (1987) - 1982
- [j2]Ryoh Fuji-Hara, Scott A. Vanstone:
Orthogonal resolutions of lines in AG(n, q). Discret. Math. 41(1): 17-28 (1982) - 1980
- [j1]Ryoh Fuji-Hara, Scott A. Vanstone:
Transversal Designs and Doubly-resolvable Designs. Eur. J. Comb. 1(3): 219-223 (1980)
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:30 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:
