Hideki Yagi

Orcid: 0000-0003-0961-7077

According to our database1, Hideki Yagi authored at least 93 papers between 2003 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Variable-Length Resolvability for General Sources and Channels.
Entropy, October, 2023

Utility-Privacy Trade-Offs with Limited Leakage for Encoder.
Entropy, June, 2023

Biometric Identification Systems with Both Chosen and Generated Secret Keys by Allowing Correlation.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., March, 2023

Performance Evaluation of Error-Correcting Output Coding Based on Noisy and Noiseless Binary Classifiers.
Int. J. Neural Syst., February, 2023

Key Agreement Using Physical Identifiers for Degraded and Less Noisy Authentication Channels.
IEEE Trans. Inf. Forensics Secur., 2023

The Secure CEO Problem With Physical Identifiers Under Logarithmic Loss and Quadratic Distortion Measures.
CoRR, 2023

80-GHz Bandwidth and High Responsivity of InP Coherent Receiver PIC with Butt-joint waveguide PDs.
Proceedings of the Optical Fiber Communications Conference and Exhibition, 2023

2022
Upper Bounds on the Error Probability for the Ensemble of Linear Block Codes with Mismatched Decoding.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022

Analysis on Optimal Error Exponents of Binary Classification for Source with Multiple Subclasses.
Entropy, 2022

Performance Evaluation of ECOC Considering Estimated Probability of Binary Classifiers.
Proceedings of the Information Systems and Technologies, 2022

Performance Analysis for Biometric Identification Systems with Nonlegitimate Users.
Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 2022

Effect of Hamming Distance on Performance of ECOC with Estimated Binary Classifiers.
Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 2022

Construction Methods for Error Correcting Output Codes Using Constructive Coding and Their System Evaluations.
Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 2022

Compact Power Splitters with Mosaic-based Structure Designed by Bayesian Direct-binary-search Method.
Proceedings of the 2022 27th OptoElectronics and Communications Conference (OECC) and 2022 International Conference on Photonics in Switching and Computing (PSC), 2022

Characteristics of GaInAsP/SOI Hybrid Semiconductor Optical Amplifier with InP-based Two-storied Ridge Structure.
Proceedings of the 2022 27th OptoElectronics and Communications Conference (OECC) and 2022 International Conference on Photonics in Switching and Computing (PSC), 2022

106-Gb/s Waveguide AlInAs/GaInAs Avalanche Photodiode with Butt-joint Coupling Structure.
Proceedings of the Optical Fiber Communications Conference and Exhibition, 2022

Secret-Key Agreement Using Physical Identifiers for Degraded and Less Noisy Authentication Channels.
Proceedings of the IEEE Information Theory Workshop, 2022

Secret Key-based Authentication With Passive Eavesdropper for Scalar Gaussian Sources.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Fundamental Limits of Biometric Identification System Under Noisy Enrollment.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

Single-Letter Characterizations for Information Erasure under Restriction on the Output Distribution.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

Biometric Identification Systems with Noisy Enrollment for Gaussian Sources and Channels.
Entropy, 2021

Unified Expression of Achievable Region in Privacy-Constrained Source Coding.
CoRR, 2021

InP-based PIC integrated with Butt-joint Coupled Waveguide p-i-n PDs for 100GBaud Coherent Networks.
Proceedings of the Optical Fiber Communications Conference and Exhibition, 2021

Optimum Intrinsic Randomness Rate with Respect to f -Divergences Using the Smooth Min Entropy.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Decision Feedback Scheme with Criterion LR+Th for the Ensemble of Linear Block Codes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020

High Linearity and Uniform Characteristics of InP-Based 8-CH Waveguide Avalanche Photodiode Array for 400 GbE.
Proceedings of the Optical Fiber Communications Conference and Exhibition, 2020

Biometric Identification Systems With Noisy Enrollment for Gaussian Source.
Proceedings of the IEEE Information Theory Workshop, 2020

Biometric Identification Systems with Both Chosen and Generated Secrecy.
Proceedings of the International Symposium on Information Theory and Its Applications, 2020

Optimum Source Resolvability Rate with Respect to f-Divergences Using the Smooth Rényi Entropy.
Proceedings of the IEEE International Symposium on Information Theory, 2020

A New Characterization of the Capacity Region of Identification Systems Under Noisy Enrollment.
Proceedings of the 54th Annual Conference on Information Sciences and Systems, 2020

The Minimum Cost of Information Erasure for Stationary Memoryless Sources under Restriction on the Output Distribution.
Proceedings of the 54th Annual Conference on Information Sciences and Systems, 2020

2019
Optimum Overflow Thresholds in Variable-Length Source Coding Allowing Non-Vanishing Error Probability.
IEEE Trans. Inf. Theory, 2019

InP-Based Photodetectors Monolithically Integrated with 90<sup>°</sup> Hybrid toward Over 400Gb/s Coherent Transmission Systems.
IEICE Trans. Electron., 2019

Fundamental Limits of Identification System With Secret Binding Under Noisy Enrollment.
CoRR, 2019

System Evaluation of Ternary Error-Correcting Output Codes for Multiclass Classification Problems.
Proceedings of the 2019 IEEE International Conference on Systems, Man and Cybernetics, 2019

Identification, Secrecy, Template, and Privacy-Leakage of Biometric Identification System under Noisy Enrollment.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Exponential Error Bounds and Decoding Complexity for Block Codes Constructed by Unit Memory Trellis Codes of Branch Length Two.
Proceedings of the 53rd Annual Conference on Information Sciences and Systems, 2019

2018
On the DS2 Bound for Forney's Generalized Decoding Using Non-Binary Linear Block Codes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

Construction of Locally Repairable Codes with Multiple Localities Based on Encoding Polynomial.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

New Results on Variable-Length Lossy Compression Allowing Positive Overflow and Excess Distortion Probabilities.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

Overflow Probability of Codeword Cost in Variable-Length Coding Problem Allowing Non-Vanishing Error Probability.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

Variable-Length Resolvability for Mixed Sources and its Application to Variable-Length Source Coding.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Variable-Length Channel Resolvability for Discrete Memoryless Sources and Channels.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
InP-Based Monolithic Integration Technologies for 100/200Gb/s Pluggable Coherent Transceivers.
IEICE Trans. Electron., 2017

Variable-Length Coding with Cost Allowing Non-Vanishing Error Probability.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

Reliability Function and Strong Converse of Biometrical Identification Systems Based on List-Decoding.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

64 GBaud high-bandwidth micro intradyne coherent receiver using high-efficiency and high-speed InP-based photodetector integrated with 90° hybrid.
Proceedings of the Optical Fiber Communications Conference and Exhibition, 2017

Overflow probability of variable-length codes allowing non-vanishing error probability.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Variable-length resolvability for general sources.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Channel resolvability theorems for general sources and channels.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Variable-length lossy compression allowing positive overflow and excess distortion probabilities.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Single-bit quantization of binary-input, continuous-output channels.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
First- and Second-Order Coding Theorems for Mixed Memoryless Channels With General Mixture.
IEEE Trans. Inf. Theory, 2016

Reliability function and strong converse of biomedical identification systems.
Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

Variable-length lossy source coding allowing some probability of union of overflow and excess distortion.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
High receiver responsivity and low dark current of InP-based pin-photodiode array monolithically integrated with 90° hybrid and spot-size converter using selective embedding regrowth.
IEICE Electron. Express, 2015

Variable-length coding with epsilon-fidelity criteria for general sources.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Information spectrum approach to fixed-length lossy source coding problem with some excess distortion probability.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Quantization of Binary-Input Discrete Memoryless Channels.
IEEE Trans. Inf. Theory, 2014

Channel dispersion for well-ordered mixed channels decomposed into memoryless channels.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

Write-Once Memory codes for low-complexity decoding of Asymmetric Multiple Access Channel.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

Single-letter characterization of epsilon-capacity for mixed memoryless channels.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Bounds on Maximum Likelihood Decoding Performance for Linear Codes at Low Rates.
IEEE Trans. Inf. Theory, 2013

High-efficient InP-based balanced photodiodes integrated with 90° hybrid MMI for compact 100 Gb/s coherent receiver.
Proceedings of the 2013 Optical Fiber Communication Conference and Exposition and the National Fiber Optic Engineers Conference (OFC/NFOEC), 2013

Compact and low power DP-QPSK modulator module with InP-based modulator and driver ICs.
Proceedings of the 2013 Optical Fiber Communication Conference and Exposition and the National Fiber Optic Engineers Conference (OFC/NFOEC), 2013

2012
Finite blocklength bounds for multiple access channels with correlated sources.
Proceedings of the International Symposium on Information Theory and its Applications, 2012

Finding the capacity of a quantized binary-input DMC.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Channel quantizers that maximize random coding exponents for binary-input memoryless channels.
Proceedings of IEEE International Conference on Communications, 2012

2011
Coset Codes for Compound Multiple Access Channels With Common Information.
IEEE Trans. Inf. Theory, 2011

Polynomial-Time Decodable Codes for Multiple Access Channels.
IEEE Commun. Lett., 2011

Quantization of Binary-Input Discrete Memoryless Channels, with Applications to LDPC Decoding
CoRR, 2011

Multi-level rate-splitting for synchronous and asynchronous interference channels.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Improved rate-equivocation regions for secure cooperative communication.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

On the capacity of fingerprinting codes against unknown size of colluders.
Proceedings of the 7th International Conference on Information Assurance and Security, 2011

2010
An iterative decoding algorithm for rate-compatible punctured low-density parity-check codes of high coding rates.
Proceedings of the International Symposium on Information Theory and its Applications, 2010

Performance analysis of linear codes under maximum likelihood decoding at low rates.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Coset codes for multiple access channels with common information based on LDPC codes.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Closest point algorithms with lp norm for root lattices.
Proceedings of the IEEE International Symposium on Information Theory, 2010

An explicit construction of concatenated codes for multiple access channels.
Proceedings of the 48th Annual Allerton Conference on Communication, 2010

2009
Fingerprinting Codes for Multimedia Data against Averaging Attack.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009

Adaptive Decoding Algorithms for Low-Density Parity-Check Codes over the Binary Erasure Channel.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009

2008
A Method for Grouping Symbol Nodes of Group Shuffled BP Decoding Algorithm.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

Density Evolution Analysis of Robustness for LDPC Codes over the Gilbert-Elliott Channel.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

Error control codes for parallel channel with correlated errors.
Proceedings of the 2008 IEEE Information Theory Workshop, 2008

2007
A Generalization of the Parallel Error Correcting Codes by Allowing Some Random Errors.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007

Improved collusion-secure codes for digital fingerprinting based on finite geometries.
Proceedings of the IEEE International Conference on Systems, 2007

2006
Fast Algorithm for Generating Candidate Codewords in Reliability-Based Maximum Likelihood Decoding.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

A Modification Method for Constructing Low-Density Parity-Check Codes for Burst Erasures.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

New Traceability Codes Against a Generalized Collusion Attack for Digital Fingerprinting.
Proceedings of the Information Security Applications, 7th International Workshop, 2006

2005
A Heuristic Search Method with the Reduced List of Test Error Patterns for Maximum Likelihood Decoding.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

GaInAsP/InP distributed reflector laser with phase-shifted DFB and quantum-wire DBR sections.
IEICE Electron. Express, 2005

2004
GaInAsP/InP long-wavelength lasers with strain-compensated quantum-wire active regions and SiO2/semiconductor reflectors.
IEICE Electron. Express, 2004

2003
Complexity Reduction of the Gazelle and Snyders Decoding Algorithm for Maximum Likelihood Decoding.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003


  Loading...