Degree

• Doctor of Engineering（Waseda University）

Research History

Education

Awards

• 電子情報通信学会 論文誌 編集活動感謝状（2021-09）
• 電子情報通信学会 基礎・境界ソサイエティ 貢献賞（2020-09）
• 電子情報通信学会 基礎・境界ソサイエティ 貢献賞（2018-09）
• 電子情報通信学会 基礎・境界ソサイエティ 貢献賞（2017-09）
• 電子情報通信学会 基礎・境界ソサイエティ 貢献賞（2016-09）
• 2006年度 情報理論とその応用学会 奨励賞（2007-11）
• 第30回 丹羽保次郎記念論文賞（2007-01）
• 第16回 早稲田大学大川功記念論文賞（2006-03）

Others

Papers

• Outer bounds on the CEO problem with privacy constraints（2025-02） [DOI]
• Optimum achievable rates in two random number generation problems with f-divergences using smooth R\'enyi entropy.（2024-09） [DOI] [DBLP] [Othres link]
• Variable-length resolvability for general sources and channels（2023-10） [DOI]
• Key agreement using physical identifiers for degraded and less noisy authentication channels（2023-09） [DOI]
• Utility-privacy trade-offs with limited leakage for encoder（2023-06）
• Utility-privacy trade-offs with limited leakage for encoder（2023-06） [DOI]
• Biometric identification systems with both chosen and generated secret keys by allowing correlation（2023-03）
• Construction methods for error correcting output codes using constructive coding and their system evaluations（2022-10-09） [DOI] [Othres link]
• Effect of Hamming distance on performance of ECOC with estimated binary classifiers（2022-10）
• Performance analysis for biometric identification systems with nonlegitimate users（2022-10）
• Unified expression of utility-privacy trade-off in privacy-constrained source coding（2022-10）
• Performance evaluation of error-correcting output coding based on noisy and noiseless binary classifiers（2022-10）
• Secret key-based authentication with passive eavesdropper for scalar Gaussian sources（2022-06-26）
• Performance evaluation of ECOC considering estimated probability of binary classifiers（2022-04-12）
• Analysis on optimal error exponents of binary classification for source with multiple subclasses（2022-04）
• Upper bounds on the error probability for the ensemble of linear block codes with mismatched decoding（2022-03-01） [DOI] [Scopus] [Scopus]
• Optimal error exponents of binary classification for sources with multiple subclasses（2022-02-28）
• Biometric identification systems with noisy enrollment for Gaussian sources and channels（2021-08-15）
• A study on the optimization of the ECOC method for multi-label classification problems（2021-08-01）
• Optimum intrinsic randomness rate with respect to f-divergences using the smooth min entropy（2021-07） [DOI] [DBLP] [Othres link] [Othres link]
• Single-letter characterizations for information erasure under restriction on the output distribution（2021-05-01）
• Fundamental limits of biometric identification system under noisy enrollment（2021-01-01）
• Biometric identification systems with both chosen and generated secrecy（2020-10-24）
• Upper bounds on the error probability for the ensemble of linear block codes with mismatched decoding（2020-10-24） [Scopus] [Scopus]
• Optimum source resolvability rate with respect to f-divergences using the smooth Rényi entropy（2020-06-21） [DOI] [DBLP] [Othres link] [Othres link]
• Binary codeword table for multilevel document classification using information theoretic criterion（2020-03-25）
• A new characterization of the capacity region of identification system under noisy enrollment（2020-03-18）
• The minimum cost of information erasure for stationary memoryless sources under restriction on the output distribution（2020-03-18）
• The Shannon cipher system with causal disclosure over separate noisy channel（2020-02-29）
• Sum-capacity region of a multi-enrollment rate-constrained system using PUF observations（2020-02-29）
• Decision feedback scheme with criterion LR+Th for the ensemble of linear block codes（2020-01） [DOI] [CiNii Research (CiNii Articles)]
• Optimum overflow thresholds in variable-length source coding allowing non-vanishing error probability（2019-12-01） [DOI] [Web of Scientce]
• System evaluation of ternary error-correcting output codes for multiclass classification problems（2019-10） [DOI] [Othres link]
• Identification, secrecy, template, and privacy-leakage of biometric identification system under noisy enrollment（2019-07-07）
• On the capacity region of an SRAM-PUF 2-enrollment rate-constrained system without cell-permutation symmetry（2019-03-04）
• Exponential error bounds and decoding complexity for block codes constructed by unit memory trellis codes of branch length two（2019-03）
• Construction of locally repairable codes with multiple localities based on encoding polynomial（2018-12-01）
• Fundamental tradeoff among identification, secrecy and compression rates in biometric identification system（2018-11-01）
• Decision feedback scheme with criterion LR+Th for the ensemble of linear block codes（2018-10-28） [DOI] [DBLP] [DBLP] [DBLP]
• New results on variable-length lossy compression allowing positive overflow and excess distortion probabilities（2018-10-28）
• Overflow probability of codeword cost in variable-length coding problem allowing non-vanishing error probability（2018-10-28） [Web of Scientce]
• A new bound of (r,\delta)-locally repairable codes over finite field of small order（2018-10-28）
• Fundamental trade-off among identification, secrecy and template rates in identification system（2018-10-28）
• On the DS2 bound for Forney's generalized decoding using non-binary linear block codes（2018-08-01） [DOI] [Scopus] [Scopus]
• A greedy construction approach of codeword table on error correcting output coding for multivalued classification and its evaluation by using artificial data（2018-06-25）
• Variable-length resolvability for mixed sources and its application to variable-length source coding（2018-06-22）
• Variable-length channel resolvability for discrete memoryless sources and channels（2018-06-21）
• Overflow probability of variable-length codes allowing non-vanishing error probability（2018-06） [DOI]
• Fundamental tradeoff among identification, secrecy and compression rates in biometric identification system（2018-03-04）
• Construction of locally repairable codes with multiple localities based on encoding polynomial（2018-03-04）
• Polar codes achieving strong secrecy for broadcast channel with confidential messages（2018-03-04）
• A simple proof of polarization for memoryless sources with and without side information（2018-03-04）
• Variable-length coding with cost allowing non-vanishing error probability（2017-08） [DOI] [Web of Scientce]
• Generalized construction of cyclic (r, t)-locally repairable codes using trace function（2017-07-01）
• Variable-length lossy compression allowing positive overflow and excess distortion probabilities（2017-06-25）
• Variable-length resolvability for general sources（2017-06-25）
• Single-bit quantization of binary-input, continuous-output channels（2017-06-25）
• Channel resolvability theorems for general sources and channels（2017-06-25）
• Reliability function and strong converse of biometrical identification systems based on list-decoding（2017-05） [DOI] [Web of Scientce]
• Lattice codes for Gaussian broadcast channel with a common message（2017-03-03）
• Capacity region of Gaussian bidirectional broadcast channel with common and confidential messages（2017-02-28）
• Variable-length coding with cost allowing non-vanishing error probability（2016-10） [Web of Scientce]
• Theory of Information Spectrum（2016-08-01）
• First- and second-order coding theorems for mixed memoryless channels with general mixture（2016-08） [DOI] [Web of Scientce]
• Variable-length lossy source coding allowing some probability of union of overflow and excess distortion（2016-07） [Web of Scientce]
• Reliability function and strong converse of biometrical identification systems（2016-07） [Web of Scientce]
• Reliability function of discrete memoryless biometrical identification systems（2016-03-07）
• On derivation of tighter Shulman-Feder bound for Forney's generalized decoding（2015-12-01）
• First- and second-order coding theorems for mixed memoryless channels with general mixture（2015-06） [Web of Scientce]
• Variable-length coding with epsilon-fidelity criteria for general sources（2015-06） [Web of Scientce]
• Information spectrum approach to fixed-length lossy source coding problem with some excess distortion probability（2015-06） [Web of Scientce]
• Channel dispersion for well-ordered mixed channels decomposed into memoryless channels（2014-10） [Web of Scientce]
• Write-once memory codes for low-complexity decoding of asymmetric multiple access channel（2014-10） [Web of Scientce]
• Quantization of binary-input discrete memoryless channels（2014-08） [DOI] [Web of Scientce]
• Single-letter characterization of epsilon-capacity for mixed memoryless channels（2014-06） [Web of Scientce]
• Bounds on maximum likelihood decoding performance for linear codes at low rates（2013-07） [DOI]
• Analysis on the fingerprinting capacity for memoryless and fair collusion attacks（2013-03）
• Finite blocklength bounds for multiple access channels with correlated sources（2012-10） [Web of Scientce]
• Finding the capacity of a quantized binary-input DMC（2012-07） [Web of Scientce]
• Channel quantizers that maximize random coding exponents for binary-input memoryless channels（2012-06） [Web of Scientce]
• On the capacity of fingerprinting codes against AND, averaging, and related attacks（2012-05）
• Polynomial-time codes against averaging attack for multimedia fingerprinting（2012-03）
• On the capacity of fingerprinting codes against unknown size of colluders（2011-12） [DOI]
• Improved rate-equivocation regions for secure cooperative communication（2011-07） [Web of Scientce]
• Coset codes for compound multiple access channels with common information（2011-06） [DOI] [Web of Scientce]
• Polynomial-time decodable codes for multiple access channels（2011-01） [DOI] [Web of Scientce]
• An iterative decoding algorithm for rate-compatible punctured low-density parity-check codes of high coding rates（2010-10） [DOI]
• An explicit construction of concatenated codes for multiple access channels（2010-09） [DOI]
• Performance analysis of linear codes under maximum likelihood decoding at low rates（2010-06） [Web of Scientce]
• Coset codes for multiple access channels with common information based on LDPC codes（2010-06） [Web of Scientce]
• Closest point algorithms with l(p) norm for root lattices（2010-06） [Web of Scientce]
• Nearest point algorithms for root lattices under norm lp（2010-04） [CiNii Research (CiNii Articles)] [CiNii Books] [Othres link]
• Concatenation of a discrete memoryless channel and a quantizer（2010-01） [DOI]
• Locally optimal message quantization for binary LDPC decoding（2010-01）
• Polynomial-time decodable fingerprinting codes for multimedia（2009-12）
• Adaptive decoding algorithms for low-density parity-check codes over the binary erasure channel（2009-10） [DOI] [Web of Scientce]
• Coset codes for compound multiple access channels with common information（2009-07） [Web of Scientce]
• Fingerprinting codes for multimedia data against averaging attack（2009-01） [DOI] [Web of Scientce]
• Random coding bounds for correlated parallel channels with unidirectionally cooperating decoders（2008-12） [Web of Scientce]
• An efficient design of irregular LDPC codes using beta approximation for the Gilbert-Elliott channel（2008-12） [Web of Scientce]
• Density evolution analysis of robustness for LDPC codes over the Gilbert-Elliott channel（2008-10） [DOI] [Web of Scientce]
• A method for grouping symbol nodes of group shuffled BP decoding agorithm（2008-10） [DOI] [Web of Scientce]
• Error control codes for parallel channel with correlated errors（2008-05） [Web of Scientce]
• Improved collusion-secure codes for digital fingerprinting based on finite geometries（2007-10） [Web of Scientce]
• Short concatenated fingerprinting codes for multimedia data（2007-09）
• A generalization of the parallel error correcting codes by allowing some random errors（2007-09） [DOI] [Web of Scientce]
• New traceability codes against a generalized collusion attack for digital fingerprinting（2007-03） [Web of Scientce]
• A generalization of the parallel error correcting codes（2006-10） [Web of Scientce]
• Peformance of low-density parity-check codes for burst erasures（2006-10）
• Fast algorithm for generating candidate codewords in reliability-based maximum likelihood decoding（2006-10） [DOI] [Web of Scientce]
• A modification method for constructing low-density parity-check codes for burst erasures（2006-10） [DOI] [Web of Scientce]
• A heuristic search method with the reduced list of test error patterns for maximum likelihood decoding（2005-10） [DOI] [Web of Scientce]
• Efficient reliability-based soft decision decoding algorithm over Markov modulated channel（2004-10）
• Modification methods for construction and performance analysis of low-density parity check-check codes over Markov-modulated channels（2004-10）
• An improved method of reliability-based maximum likelihood decoding algorithms using an order relation among binary vectors（2004-10） [Web of Scientce]
• Complexity reduction of the Gazelle and Snyders decoding algorithm for maximum likelihood decoding（2003-10） [Web of Scientce]

Misc

• A note on conditions on random number generations with f-divergence（2024-12）
• Upper bounds on error probability for linear codes with mismatched decoding using decision feedback scheme（2024-12）
• Fast Polarization for Joint Source-Channel Coding with Side Information at Decoder（2024-12）
• Channel polarization for asymmetric q-Ary channels with q=2^r（2023-11）
• A problem of common randomness with capacity constraints over slow fading channel using two outage probabilities（2023-11）
• Strong secrecy of biometric identification systems with passive eavesdropper（2023-11）
• Multi-class classification based on error correcting output codes（2023-11）
• Source coding With unreliable side information under average error criterion（2023-08）
• Polarization analysis for joint source-channel coding with side information（2023-08）
• An improved context tree switching method by dynamic expansion and pruning of context tree（2023-01）
• A problem of common randomness over slow fading channel using outage probabilities（2022-11）
• Biometric identification systems with enrollment noise and passive eavesdropper（2022-11）
• Strong converse theorem for utility-privacy trade-offs（2022-11）
• Extensible polarization-adjusted convolutional codes and its application to rateless codes（2022-05）
• Hybrid-ARQ scheme using systematic polarization-adjusted couvolutional codes（2022-03-03）
• Construction for BICM polar codes with polarization weight（2022-03-03）
• A construction method for ECOC with constructive coding（2022-03）
• Multivalued classification performance based on estimation error of binary classifiers（2021-12）
• Analysis on optimal error exponents of binary classification for mixed sources（2021-12）
• A unified expression of achievable region in privacy-constrained source coding（2021-12）
• Intrinsic randomness rate with respect to subclass of f-divergences using the smooth min entropy（2021-11-24）
• A construction method for ECOC with constructive coding（2021-05）
• Analysis of optimal error exponents for classification for Markov sources（2021-03-05）
• Local recovery with error tolerance for locally recoverable codes（2020-12-03）
• A study on the optimization of the ECOC method for multi-label classification problems（2020-12）
• A selection method of transmitted bits for Polar Codes using generalized Hamming weights（2020-07-16）
• A new characterization of the capacity region of biometric identification system under noisy enrollment（2019-11-29）
• Sum-capacity region of an SRAM-PUF multi-enrollment rate-constrained system（2019-11-29）
• A single-letter characterization for the minimum cost of information erasure under restriction on the output distribution（2019-11-29）
• The Shannon cipher system over noisy channel with causal disclosure（2019-11-29）
• Optimum source resolvability rate with respect to f-divergence and smooth Renyi entropy（2019-10-17）
• A multi-value classification method using q-ary Exhaustive Code（2019-09-03）
• An improved bound on the dimension of (r, \delta)-locally repairable codes（2018-12-11）
• Fundamental trade-off among identification, secrecy, template, and privacy-leakage rates in biometric identification system（2018-12-11）
• Error exponent analysis for biometric identification systems with nonlegitimate entities（2018-12-11）
• Polar codes achieving strong secrecy for broadcast channel with two confidential messages（2018-12）
• An improved bound on dimension of locally repairable codes（2018-09-05）
• On the minimum cost of information erasure for stationary memoryless sources（2018-07-19）
• Lattice codes for strong interference channel via rate-splitting approach（2018-01-23）
• A simple proof of polarization for stationary memoryless sources and its extension to non-stationary memoryless sources（2018-01-23）
• Bidirectional broadcast channel under strong secrecy and cost constraints（2018-01-23）
• The capacity region of identification, secrecy and compression rates in biometric identification systems（2018-01-22）
• Variable-length channel resolvability for discrete memoryless sources and channels（2017-11-30）
• A study on codeword table construction in multilevel classification based on error correcting code using artificial data（2017-11-29）
• Variable-length channel resolvability for mixed sources and non-mixed channels（2017-10-20）
• Biometric identification system with protected templates under noisy enrollment（2017-09-12）
• First- and second-order optimistic coding theorems on variable-length codes allowing non-vanishing error probability（2017-09-08） [CiNii Research (CiNii Articles)] [CiNii Books] [Othres link]
• A codeword construction method for multilevel document classification using correlation of binary discriminators from the viewpoint of coding theory（2017-09）
• Construction of coding table method focused on correlation of binary discriminator in multilevel document classification based on coding theory（2017-09）
• Polar codes achieving strong secrecy for broadcast channel with confidential messages（2017-07-13）
• Exponential error bounds for block codes constructed by unit memory trellis codes（2017-07-13） [CiNii Research (CiNii Articles)] [CiNii Books] [Othres link]
• Construction of locally repairable codes with multiple localities based on encoding polynomial（2017-07）
• Overflow probability of variable-length codes allowing non-vanishing error probability（2017-03-09） [CiNii Research (CiNii Articles)] [CiNii Books] [Othres link]
• On block codes constructed by tail biting unit memory trellis codes（2017-03）
• A study on construction of ECOC matrix for multi-valued document classification based on performance of binary classifiers（2017-03）
• Variable-length lossy compression allowing positive overflow and excess distortion probabilities（2016-12-14）
• Optimistic channel resolvability and the strong converse property（2016-12-14）
• Channel resolvability over single and compound channels（2016-09-02） [CiNii Research (CiNii Articles)] [CiNii Books] [Othres link]
• Lattice codes for Gaussian broadcast channel with common message（2016-07-21）
• Polar coding for bidirectional broadcast channel with non-binary output alphabets（2016-07-21） [CiNii Research (CiNii Articles)] [CiNii Books] [Othres link]
• Refined analysis of optimum coding rate for channels with states（2016-03-11）
• Shulman-Feder bound for Forney's generalized decoding using q-ary linear codes（2015-11）
• Variable-length coding with cost allowing non-vanishing error probability（2015-11）
• Analysis on reliability function and strong converse of discrete memoryless biometrical identification systems（2015-05-21） [CiNii Research (CiNii Articles)] [Othres link]
• The capacity region of general multiple access channel with partially cooperating encoders（2014-12-02）
• Optimistic coding with an epsilon-fidelity criterion and strong converse theorem（2014-12）
• Source coding theorem with a fidelity criterion allowing some probability of union of overflow and excess distortion（2014-12）
• Applying write once memory codes to asymmetric multiple access channel with errors（2014-12）
• Finite-length analysis in channel coding（2014-09-23）
• On relations between DS2 bound and Sulman-Feder bound for Forney's Generalized Decoding（2014-09-19） [CiNii Research (CiNii Articles)] [CiNii Books] [Othres link]
• A sweeping trend in theory of channel coding -finite blocklength analysis-（2013-11-26） [CiNii Research (CiNii Articles)] [CiNii Books] [Othres link]
• Error expoenent of universal fingerprinting code for memoryless and fair collusion attacks（2013-11-19）
• Two-bit LDPC LUT decoder based on maximization of mutual information（2013-11-19）
• Channel dispersion for a class of mixed channels decomposed into stationary memoryless channels（2013-11）
• Finite blocklength analysis for multiple access channels and composite hypothesis testing（2012-12）
• Analysis on the fingerprinting capacity for the memoryless and fair collusion Attacks（2012-12）
• The capacity of fingerprinting codes against several attack classes with unknown size of colluders（2011-11）
• An approach to designing channel quantizers using the random coding exponent（2011-11）
• Replica shuffled BP decoding algorithms for irregular LDPC codes based on degree distributions（2008-10）
• A locally modified image detection method using Euler vector（2008-10）
• On designing irregular LDPC codes using accurate densities for Gilbert-Elliott channel（2008-10）
• Near duplicated image detection by learning with difference vector to original image（2008-02）
• Image retrieval using bit-plane for JPEG2000 coded texture image（2007-12）
• A heuristic search method of symbol node grouping for ahuffled BP decoding algorithm（2007-11）
• Error control codes for parallel channel with correlated errors（2007-10）
• A symbol grouping method of shuffled BP algorithm for LDPC codes（2007-05）
• Shortened and concatenated collusion-secure codes for digital fingerprinting（2007-05）
• Shortening methods of collusion-secure codes for digital fingerprinting（2007-05）
• An adaptive decoding algorithm of LDPC codes over the binary erasure channel（2007-05）
• Text Categorization Using Naive Bayes Model Based on Co-Occurrence words（2006-11-28） [CiNii Research (CiNii Articles)] [CiNii Books]
• Document clustering methods based on probabilistic latent semantic indexing with feature of words（2006-11-28） [CiNii Research (CiNii Articles)] [CiNii Books]
• Improved bit-flipping decoding algorithms of lowdensity parity-check codes with updating reliabilities（2006-11）
• Performance analysis of EM decoding algorithm for HMM channels（2006-11）
• On correctable burst-erasure lengths for LDPC codes with column permuted parity-check matrices（2006-11）
• Decoding performance of linear parallel error correcting codes（2006-11）
• A new class of traceability codes for digital fingerprinting（2006-05）
• A modification method for constructing low-density parity-check codes for burst erasures（2006-03）
• A method of a detection of double-use of the ticket for e-ticket system of refreshable tokens（2005-11）
• Weighted bit-flipping decoding algorithms of low-density parity-check codes with updating reliabilities（2005-11）
• Collusion-secure codes for fingerprinting based on finite geometries（2005-11）
• A decoding algorithm for q-ary turbo codes by deleting trellis branches（2005-07）
• Fast algorithm for generating candidate codewords in reliability-based maximum likelihood decoding（2005-05）
• A relevance feedback method using several query vectors（2004-12-14） [CiNii Research (CiNii Articles)] [CiNii Books]
• An improved soft-decision decoding algorithm based on sort-and-match technique（2004-12-14） [CiNii Research (CiNii Articles)] [CiNii Books]
• Complexity reduction method of suboptimal maximum likelihood decoding algorithms for tail-biting convolutional codes（2004-07）
• Analysis of decoding performance of low-density parity-check codes for channels with memory（2003-12）
• An efficient block turbo decoding algorithm over channels with memory（2003-12）
• A method for reducing space complexity of reliability based heuristic search maximum likelihood decoding algorithms（2003-12）
• Turbo decoding algorithms for burst error channels -efficient decoding algorithms of block turbo codes-（2003-07）
• Construction methods of low-density parity-check codes for burst error channels（2003-07）
• An improved method of maximum likelihood decoding algorithms using the most reliable basis based on an order relation among binary vectors（2003-05）
• An efficient reliability-based soft desicion decoding algorithm over hidden Markov noise channel（2002-12）
• A decoding algorithm of low density parity check codes for hidden Markov noise channel（2002-07）
• On sectionalization of trellis for block codes（2000-03）

Presentations

• 非一様な入力に対する多重アクセス通信路の分極現象（2024-12）
• 動く教材で学ぶデータエンジニアリング
• A unified approach to designing channel quantizers for binary-input memoryless channels（2011-09）
• Generalized time-sharing for asynchronous interference channels（2011-02）
• Improved rate-equivocation regions for secure cooperative communication（2011-02）
• Optimal non-uniform quantization of LDPC decoders（2010-02）
• Error exponents for linear codes under maximum likelihood decoding at low rates（2010-02）

Books and Other Publications

Works

Research Projects

Media Coverage

• 早大と電通大、2値分類器の結合による多値分類法の理論的解析に成功（日本経済新聞社）（2023-03）

Industrial Property Rights

Professional Memberships

• Soc. of Information Theory and its Applications (SITA)
• Research Institute of Signal Processing, Japan
• IEICE
• IEEE

Committee Memberships

Teaching Experience

Social Contribution

Academic Contribution

• 第48回情報理論とその応用シンポジウム(SITA2025)