default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHiroki Koga
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j20]Hiroki Koga:
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106(3): 358 (2023)- 2022
- [c34]Hiroki Koga:
Construction of the Visual Cryptography Scheme with the Maximum Relative Difference under a Strong General Access Structure. ISIT 2022: 660-665 - [c33]Akihito Nagaya, Hiroki Koga:
On the Optimum Achievable Rates of a Coded Caching Scheme with Small Cache Memory. ISITA 2022: 44-48 - [c32]Raiki Ioki, Hiroki Koga:
On the Optimal Construction of a Visual Cryptography Scheme for Multiple Secret Images. ISITA 2022: 159-163 - 2021
- [j19]Kyohei Sekine, Hiroki Koga:
Optimal Basis Matrices of a Visual Cryptography Scheme with Meaningful Shares and Analysis of Its Security. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 104-A(9): 1235-1244 (2021) - [c31]Hiroki Koga:
Coding Theorems on Digital Fingerprinting Coding under Informed and Uninformed Setups. ITW 2021: 1-6 - [c30]Daisuke Saito, Toshiyuki Kobayashi, Hiroki Koga, Nicolo Ronchi, Kaustuv Banerjee, Yusuke Shuto, Jun Okuno, Kenta Konishi, Luca Di Piazza, Arindam Mallik, Jan Van Houdt, Masanori Tsukamoto, Kazunobu Ohkuri, Taku Umebayashi, Takayuki Ezaki:
Analog In-memory Computing in FeFET-based 1T1R Array for Edge AI Applications. VLSI Circuits 2021: 1-2 - 2020
- [c29]Sayaka Doi, Hiroki Koga, Tomonori Seki, Yutaro Okuno:
Novel Proximity Sensor for Realizing Tactile Sense in Suction Cups. ICRA 2020: 638-643 - [c28]Yohei Okawa, Hiroki Koga:
An Ideal Secret Sharing Scheme Realizing an Access Structure Based on a Finite Projective Plane of Order 3. ISIT 2020: 852-857 - [c27]Hiroki Koga:
Coding Theorems on the Simple Capacity for Digital Fingerprinting Codes. ISITA 2020: 61-65 - [c26]Kyohei Sekine, Hiroki Koga:
Optimal Basis Matrices of a Visual Cryptography Scheme with Meaningful Shares and Analysis of Its Security. ISITA 2020: 422-426 - [c25]Ryo Okamura, Hiroki Koga:
New Constructions of an Evolving 2-Threshold Scheme Based on Binary or D-ary Prefix Codes. ISITA 2020: 432-436
2010 – 2019
- 2018
- [c24]Hiroki Koga:
A Lower Bound on the Joint Capacity of Digital Fingerprinting Codes Using Score Functions Based on Log-Likelihood Ratio. ISIT 2018: 1136-1140 - [c23]Koutaro Okada, Hiroki Koga:
A Construction of the (4, n)-Threshold Visual Cryptography Scheme Using a 3-Design. ISITA 2018: 223-227 - 2017
- [j18]Jun Muramatsu
, Hiroki Koga:
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(12): 2556-2557 (2017) - [c22]Tsutomu Haruta, Tsutomu Nakajima, Jun Hashizume, Taku Umebayashi, Hiroshi Takahashi, Kazuo Taniguchi, Masami Kuroda, Hiroshi Sumihiro, Koji Enoki, Takatsugu Yamasaki, Katsuya Ikezawa, Atsushi Kitahara, Masao Zen, Masafumi Oyama, Hiroki Koga, Hidenobu Tsugawa, Tomoharu Ogita, Takashi Nagano, Satoshi Takano, Tetsuo Nomoto:
4.6 A 1/2.3inch 20Mpixel 3-layer stacked CMOS Image Sensor with DRAM. ISSCC 2017: 76-77 - [c21]Koutaro Okada, Hiroki Koga:
A construction of the progressive (3, n)-threshold visual cryptography using a BIBD and analysis of its optimality. ITW 2017: 249-253 - 2016
- [c20]Hiroki Koga, Kaoru Itabashi:
A Higher Order Analysis of the Joint Capacity of Digital Fingerprinting Codes against the Interleaving Attack. IH&MMSec 2016: 23-28 - [c19]Shota Kamiya, Hiroki Koga:
New fundamental properties on a secret-key cryptosystem under guessing secrecy criteria. ISITA 2016: 345-349 - 2015
- [c18]Hiroki Koga:
On a partition of a finite set and its relationships to encoding tasks and the Rényi entropy. ISIT 2015: 1452-1456 - 2014
- [j17]Takemasa Yokoyama, Yasuki Noguchi, Hiroki Koga, Ryosuke Tachibana, Jun Saiki, Ryusuke Kakigi, Shinichi Kita:
Multiple neural mechanisms for coloring words in synesthesia. NeuroImage 94: 360-371 (2014) - [c17]Hiroki Koga, Hiroyuki Goto, Eishi Chiba:
Resolution of resource conflicts in the CCPM framework using a local search method. IEEM 2014: 94-98 - [c16]Hiroki Koga, Shuntaro Honjo:
A secret sharing scheme based on a systematic Reed-Solomon code and analysis of its security for a general class of sources. ISIT 2014: 1351-1355 - [c15]Hiroki Koga:
On the capacity and the zero-error capacity of k-resilient AND anti-collusion codes. ITW 2014: 177-181 - 2013
- [j16]Mitsuharu Arimura, Hiroki Koga, Ken-ichi Iwata:
Redundancy-Optimal FF Codes for a General Source and Its Relationships to the Rate-Optimal FF Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(12): 2332-2342 (2013) - [j15]Mitsuharu Arimura, Hiroki Koga, Ken-ichi Iwata:
A Characterization of Optimal FF Coding Rate Using a New Optimistically Optimal Code. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(12): 2443-2446 (2013) - [c14]Hiroki Koga:
Characterization of the smooth Rényi Entropy Using Majorization. ITW 2013: 1-5 - 2012
- [j14]Hiroki Koga:
On the Achievable Rate Region in the Optimistic Sense for Separate Coding of Two Correlated General Sources. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 95-A(12): 2100-2106 (2012) - [j13]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) - [c13]Hiroki Koga, Kazuya Koyano:
On the role of mutual infomation between the shares in a robust (k, n)-threshold scheme. ISITA 2012: 260-264 - 2011
- [j12]Hiroki Koga, Takeru Ishihara:
A general method for construction of (t, n)-threshold visual secret sharing schemes for color images. Des. Codes Cryptogr. 61(2): 223-249 (2011) - [j11]Hiroki Koga, Yusuke Minami:
A Digital Fingerprinting Code Based on a Projective Plane and Its Identifiability of All Malicious Users. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(1): 223-232 (2011) - [j10]Hiroki Koga:
Four Limits in Probability and Their Roles in Source Coding. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(11): 2073-2082 (2011) - [c12]Hiroki Koga, Mitsuharu Arimura, Ken-ichi Iwata:
Coding theorems on the worst-case redundancy of fixed-length coding for a general source. ISIT 2011: 1327-1331 - 2010
- [j9]Hiroyuki Ishii, Hiroki Koga, Yuichi Obokawa, Jorge Solis, Atsuo Takanishi, Akitoshi Katsumata:
Path generator control system and virtual compliance calculator for maxillofacial massage robots. Int. J. Comput. Assist. Radiol. Surg. 5(1): 77-84 (2010) - [c11]Hiroki Koga:
A simple secret sharing scheme using a key and its security against substitution of shares. ISIT 2010: 2483-2487 - [c10]Hiroki Koga:
Two generalizations of a coding theorem for a (2, 2)-threshold scheme with a cheater. ISITA 2010: 678-683 - [i1]Mitsugu Iwamoto, Hiroki Koga, Hirosuke Yamamoto:
Coding Theorems for Cheating-Detectable Secret Sharing Schemes with Two Shares. CoRR abs/1004.4530 (2010)
2000 – 2009
- 2009
- [j8]Hiroyuki Ishii, Hiroki Koga, Yuichi Obokawa, Jorge Solis, Atsuo Takanishi, Akitoshi Katsumata:
Development and Experimental Evaluation of Oral Rehabilitation Robot that Provides Maxillofacial Massage to Patients with Oral Disorders. Int. J. Robotics Res. 28(9): 1228-1239 (2009) - [c9]Mitsugu Iwamoto, Hirosuke Yamamoto, Hiroki Koga:
A coding theorem for cheating-detectable (2, 2)-threshold blockwise secret sharing schemes. ISIT 2009: 1308-1312 - 2008
- [j7]Hiroki Koga:
Coding Theorems on the Threshold Scheme for a General Source. IEEE Trans. Inf. Theory 54(6): 2658-2677 (2008) - 2007
- [j6]Hiroki Koga:
Source Coding Using Families of Universal Hash Functions. IEEE Trans. Inf. Theory 53(9): 3226-3233 (2007) - [c8]Hiroki Koga, Isao Nakano:
Coding Theorems for General Stegosystems. ISIT 2007: 2456-2460 - 2006
- [j5]Hiroki Koga, Etsuyo Ueda:
Basic Properties of the (t, n)-Threshold Visual Secret Sharing Scheme with Perfect Reconstruction of Black Pixels. Des. Codes Cryptogr. 40(1): 81-102 (2006) - [c7]Hiroki Koga, Etsuyo Ueda:
Proposal of an Asymptotically Contrast-Ideal (t, n)- Threshold Visual Secret Sharing Scheme. ISIT 2006: 912-916 - 2005
- [j4]Hiroki Koga, Hirosuke Yamamoto:
Asymptotic properties on codeword lengths of an optimal FV code for general sources. IEEE Trans. Inf. Theory 51(4): 1546-1555 (2005) - [c6]Hiroki Koga:
Coding theorems on the threshold scheme for a general source. ICITS 2005: 67-72 - [c5]Hiroki Koga, Naoki Sato:
On an upper bound of the secrecy capacity for a general wiretap channel. ISIT 2005: 1641-1645 - 2004
- [c4]Hiroki Koga:
Source coding using a class of universal hash functions. ISIT 2004: 431 - 2003
- [j3]Takeru Ishihara, Hiroki Koga:
A Visual Secret Sharing Scheme for Color Images Based on Meanvalue-Color Mixing. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(1): 194-197 (2003) - [j2]Jun Muramatsu, Hiroki Koga, Takafumi Mukouchi:
On the Problem of Generating Mutually Independent Random Sequences. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(5): 1275-1284 (2003) - [c3]Hiroki Koga:
A Constraint-based Grammar of Case : To Correctly Predict Case Phrases Occurring without Their Head Verb. PACLIC 2003: 351-361 - 2002
- [j1]Takeru Ishihara, Hiroki Koga:
New Constructions of the Lattice-Based Visual Secret Sharing Scheme Using Mixture of Colors. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(1): 158-166 (2002) - [c2]Hiroki Koga:
A General Formula of the (t, n)-Threshold Visual Secret Sharing Scheme. ASIACRYPT 2002: 328-345
1990 – 1999
- 1997
- [c1]Suguru Arimoto, Hiroki Koga, Tomohide Naniwa:
Proposal of the-law-of-inertia (friction/gravity-free) robots. ICRA 1997: 2232-2239
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-17 20:32 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:
