default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHirosuke Yamamoto
- > Home > Persons > Hirosuke Yamamoto
Publications
- 2019
[i18]A. J. Han Vinck, Kees A. Schouhamer Immink, Tadashi Wadayama, Van Khu Vu, Akiko Manada, Kui Cai, Shunsuke Horii, Yoshiki Abe, Mitsugu Iwamoto, Kazuo Ohta, Xingwei Zhong, Zhen Mei, Renfei Bu, Jos H. Weber, Vitaly Skachek, Hiroyoshi Morita, N. Hovhannisyan, Hiroshi Kamabe, Shan Lu, Hirosuke Yamamoto, Kengo Hashimoto, Øyvind Ytrehus, Shigeaki Kuzuoka, Mikihiko Nishiara, Han Mao Kiah, Jun Muramatsu, Shigeki Miyake:
Proceedings of the 11th Asia-Europe Workshop on Concepts in Information Theory. CoRR abs/1907.02944 (2019)- 2017
- [i15]Kees A. Schouhamer Immink, Stan Baggen, Ferdaous Chaabane, Yanling Chen, Peter H. N. de With, Héla Gassara, Hamed Gharbi, Adel Ghazel, Khaled Grati, Naira M. Grigoryan, Ashot N. Harutyunyan, Masayuki Imanishi, Mitsugu Iwamoto, Ken-ichi Iwata, Hiroshi Kamabe, Brian M. Kurkoski, Shigeaki Kuzuoka, Patrick Langenhuizen, Jan Lewandowsky, Akiko Manada, Shigeki Miyake, Hiroyoshi Morita, Jun Muramatsu, Safa Najjar, Arnak V. Poghosyan, Fatma Rouissi, Yuta Sakai, Ulrich Tamm, Joost van der Putten, Fons van der Sommen, A. J. Han Vinck, Tadashi Wadayama, Dirk Wübben, Hirosuke Yamamoto:
Proceedings of Workshop AEW10: Concepts in Information Theory and Communications. CoRR abs/1707.08567 (2017) - 2012
- [j35]Mitsugu Iwamoto, Hiroki Koga, Hirosuke Yamamoto
:
Coding Theorems for a (2, 2)-Threshold Scheme With Detectability of Impersonation Attacks. IEEE Trans. Inf. Theory 58(9): 6194-6206 (2012) - 2010
- [i7]Mitsugu Iwamoto, Hiroki Koga, Hirosuke Yamamoto:
Coding Theorems for Cheating-Detectable Secret Sharing Schemes with Two Shares. CoRR abs/1004.4530 (2010) - 2009
- [c10]Mitsugu Iwamoto, Hirosuke Yamamoto, Hiroki Koga:
A coding theorem for cheating-detectable (2, 2)-threshold blockwise secret sharing schemes. ISIT 2009: 1308-1312 - 2007
- [j27]Mitsugu Iwamoto, Hirosuke Yamamoto, Hirohisa Ogawa:
Optimal Multiple Assignments Based on Integer Programming in Secret Sharing Schemes with General Access Structures. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(1): 101-112 (2007) - 2006
- [j26]Mitsugu Iwamoto, Hirosuke Yamamoto:
Strongly secure ramp secret sharing schemes for general access structures. Inf. Process. Lett. 97(2): 52-57 (2006) - 2005
- [c3]Mitsugu Iwamoto, Hirosuke Yamamoto:
Strongly secure ramp secret sharing schemes. ISIT 2005: 1221-1225 - [i4]Mitsugu Iwamoto, Hirosuke Yamamoto, Hirohisa Ogawa:
Optimal multiple assignments based on integer programming in secret sharing schemes with general access structures. CoRR abs/cs/0506064 (2005) - [i3]Mitsugu Iwamoto, Hirosuke Yamamoto:
Strongly secure ramp secret sharing schemes for general access structures. CoRR abs/cs/0506065 (2005) - 2004
- [c1]Mitsugu Iwamoto, Hirosuke Yamamoto, Hirohisa Ogawa:
Optimal multiple assignments based on integer programming in secret sharing schemes. ISIT 2004: 16 - 2003
- [j23]Mitsugu Iwamoto, Hirosuke Yamamoto:
A Construction Method of Visual Secret Sharing Schemes for Plural Secret Images. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(10): 2577-2588 (2003) - 2002
- [j21]Mitsugu Iwamoto, Hirosuke Yamamoto:
The Optimal n-out-of-n Visual Secret Sharing Scheme for Gray-Scale Images. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(10): 2238-2247 (2002)
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 2025-05-06 21:34 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:
