Citations per year, relative to Hiroki Koga Hiroki Koga (= 1×)
peers
Yuval Kochman
Countries citing papers authored by Hiroki Koga
Since
Specialization
Citations
This map shows the geographic impact of Hiroki Koga's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Hiroki Koga with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Hiroki Koga more than expected).
This network shows the impact of papers produced by Hiroki Koga. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Hiroki Koga. The network helps show where Hiroki Koga may publish in the future.
Co-authorship network of co-authors of Hiroki Koga
This figure shows the co-authorship network connecting the top 25 collaborators of Hiroki Koga.
A scholar is included among the top collaborators of Hiroki Koga based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Hiroki Koga. Hiroki Koga is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Koga, Hiroki, et al.. (2020). New Constructions of an Evolving 2-Threshold Scheme Based on Binary or D-ary Prefix Codes. International Symposium on Information Theory and its Applications. 432–436.1 indexed citations
Koga, Hiroki, et al.. (2012). On the role of mutual infomation between the shares in a robust (k, n)-threshold scheme. International Symposium on Information Theory and its Applications. 260–264.2 indexed citations
8.
Koga, Hiroki, et al.. (2011). The Width of Information-Spectrum and the Worst-Case Redundancy of Fixed-Length Coding. 110(442). 93–98.1 indexed citations
9.
Koga, Hiroki. (2011). Four Limits in Probability and Coding of a General Source. IEICE Technical Report; IEICE Tech. Rep.. 110(363). 37–42.1 indexed citations
Koga, Hiroki. (2010). On the Capacity of the AND Anti-Collusion Fingerprinting Codes. IEICE Technical Report; IEICE Tech. Rep.. 109(444). 439–444.
12.
Iwamoto, Mitsugu, Hiroki Koga, & H. Yamamoto. (2010). Coding Theorems for Cheating-Detectable Secret Sharing Schemes with Two Shares.1 indexed citations
Koga, Hiroki, et al.. (2004). New Results on Optimistic Source Coding. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 87(10). 2577–2580.4 indexed citations
17.
Koga, Hiroki, et al.. (2003). A visual secret sharing scheme for color images based on meanvalue-color mixing. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 86(1). 194–197.10 indexed citations
18.
Koga, Hiroki, et al.. (2002). New Constructions of the Lattice-Based Visual Secret Sharing Scheme Using Mixture of Colors. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 85(1). 158–166.7 indexed citations
19.
Koga, Hiroki, Mitsugu Iwamoto, & H. Yamamoto. (2001). An Analytic Construction of the Visual Secret Sharing Scheme for Color Images. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 84(1). 262–272.21 indexed citations
20.
Koga, Hiroki & H. Yamamoto. (1998). Proposal of a lattice-based visual secret sharing scheme for color and gray-scale images. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 81(6). 1262–1269.37 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.