Hiroki Koga

According to our database1, Hiroki Koga authored at least 51 papers between 1997 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Foreword.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., March, 2023

2022
Construction of the Visual Cryptography Scheme with the Maximum Relative Difference under a Strong General Access Structure.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Optimal Basis Matrices of a Visual Cryptography Scheme with Meaningful Shares and Analysis of Its Security.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

Analog In-memory Computing in FeFET-based 1T1R Array for Edge AI Applications.
Proceedings of the 2021 Symposium on VLSI Circuits, Kyoto, Japan, June 13-19, 2021, 2021

Coding Theorems on Digital Fingerprinting Coding under Informed and Uninformed Setups.
Proceedings of the IEEE Information Theory Workshop, 2021

2020
New Constructions of an Evolving 2-Threshold Scheme Based on Binary or D-ary Prefix Codes.
Proceedings of the International Symposium on Information Theory and Its Applications, 2020

Coding Theorems on the Simple Capacity for Digital Fingerprinting Codes.
Proceedings of the International Symposium on Information Theory and Its Applications, 2020

An Ideal Secret Sharing Scheme Realizing an Access Structure Based on a Finite Projective Plane of Order 3.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Novel Proximity Sensor for Realizing Tactile Sense in Suction Cups.
Proceedings of the 2020 IEEE International Conference on Robotics and Automation, 2020

2018
A Construction of the (4, n)-Threshold Visual Cryptography Scheme Using a 3-Design.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

A Lower Bound on the Joint Capacity of Digital Fingerprinting Codes Using Score Functions Based on Log-Likelihood Ratio.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Foreword.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

A construction of the progressive (3, n)-threshold visual cryptography using a BIBD and analysis of its optimality.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017


2016
New fundamental properties on a secret-key cryptosystem under guessing secrecy criteria.
Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

A Higher Order Analysis of the Joint Capacity of Digital Fingerprinting Codes against the Interleaving Attack.
Proceedings of the 4th ACM Workshop on Information Hiding and Multimedia Security, 2016

2015
On a partition of a finite set and its relationships to encoding tasks and the Rényi entropy.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Multiple neural mechanisms for coloring words in synesthesia.
NeuroImage, 2014

On the capacity and the zero-error capacity of k-resilient AND anti-collusion codes.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

A secret sharing scheme based on a systematic Reed-Solomon code and analysis of its security for a general class of sources.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Resolution of resource conflicts in the CCPM framework using a local search method.
Proceedings of the 2014 IEEE International Conference on Industrial Engineering and Engineering Management, 2014

2013
A Characterization of Optimal FF Coding Rate Using a New Optimistically Optimal Code.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013

Redundancy-Optimal FF Codes for a General Source and Its Relationships to the Rate-Optimal FF Codes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013

Characterization of the smooth Rényi Entropy Using Majorization.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

2012
Coding Theorems for a (2, 2)-Threshold Scheme With Detectability of Impersonation Attacks.
IEEE Trans. Inf. Theory, 2012

On the Achievable Rate Region in the Optimistic Sense for Separate Coding of Two Correlated General Sources.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012

On the role of mutual infomation between the shares in a robust (k, n)-threshold scheme.
Proceedings of the International Symposium on Information Theory and its Applications, 2012

2011
A Digital Fingerprinting Code Based on a Projective Plane and Its Identifiability of All Malicious Users.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

Four Limits in Probability and Their Roles in Source Coding.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

A general method for construction of (<i>t</i>, <i>n</i>)-threshold visual secret sharing schemes for color images.
Des. Codes Cryptogr., 2011

Coding theorems on the worst-case redundancy of fixed-length coding for a general source.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
Coding Theorems for Cheating-Detectable Secret Sharing Schemes with Two Shares
CoRR, 2010

Path generator control system and virtual compliance calculator for maxillofacial massage robots.
Int. J. Comput. Assist. Radiol. Surg., 2010

Two generalizations of a coding theorem for a (2, 2)-threshold scheme with a cheater.
Proceedings of the International Symposium on Information Theory and its Applications, 2010

A simple secret sharing scheme using a key and its security against substitution of shares.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Development and Experimental Evaluation of Oral Rehabilitation Robot that Provides Maxillofacial Massage to Patients with Oral Disorders.
Int. J. Robotics Res., 2009

A coding theorem for cheating-detectable (2, 2)-threshold blockwise secret sharing schemes.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Coding Theorems on the Threshold Scheme for a General Source.
IEEE Trans. Inf. Theory, 2008

2007
Source Coding Using Families of Universal Hash Functions.
IEEE Trans. Inf. Theory, 2007

Coding Theorems for General Stegosystems.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
Basic Properties of the (<i>t</i>, <i>n</i>)-Threshold Visual Secret Sharing Scheme with Perfect Reconstruction of Black Pixels.
Des. Codes Cryptogr., 2006

Proposal of an Asymptotically Contrast-Ideal (t, n)- Threshold Visual Secret Sharing Scheme.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
Asymptotic properties on codeword lengths of an optimal FV code for general sources.
IEEE Trans. Inf. Theory, 2005

On an upper bound of the secrecy capacity for a general wiretap channel.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
Source coding using a class of universal hash functions.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
On the Problem of Generating Mutually Independent Random Sequences.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

A Visual Secret Sharing Scheme for Color Images Based on Meanvalue-Color Mixing.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

A Constraint-based Grammar of Case : To Correctly Predict Case Phrases Occurring without Their Head Verb.
Proceedings of the 17th Pacific Asia Conference on Language, Information and Computation, 2003

2002
New Constructions of the Lattice-Based Visual Secret Sharing Scheme Using Mixture of Colors.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002

A General Formula of the (t, n)-Threshold Visual Secret Sharing Scheme.
Proceedings of the Advances in Cryptology, 2002

1997
Proposal of the-law-of-inertia (friction/gravity-free) robots.
Proceedings of the 1997 IEEE International Conference on Robotics and Automation, 1997


  Loading...