| Quantization of binary-input discrete memoryless channels BM Kurkoski, H Yagi IEEE Transactions on Information Theory 60 (8), 4544-4552, 2014 | 141 | 2014 |
| Single-bit quantization of binary-input, continuous-output channels BM Kurkoski, H Yagi 2017 IEEE International Symposium on Information Theory (ISIT), 2088-2092, 2017 | 22 | 2017 |
| Concatenation of a discrete memoryless channel and a quantizer BM Kurkoski, H Yagi 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo …, 2010 | 15 | 2010 |
| A modification method for constructing low-density parity-check codes for burst erasures G HOSOYA, H YAGI, T MATSUSHIMA, S HIRASAWA IEICE transactions on fundamentals of electronics, communications and …, 2006 | 15 | 2006 |
| First-and second-order coding theorems for mixed memoryless channels with general mixture H Yagi, TS Han, R Nomura IEEE Transactions Information Theory, 4395-4412, 2016 | 14 | 2016 |
| A new characterization of the capacity region of identification systems under noisy enrollment V Yachongka, H Yagi 2020 54th Annual Conference on Information Sciences and Systems (CISS), 1-6, 2020 | 13 | 2020 |
| Quantization of binary-input discrete memoryless channels, with applications to LDPC decoding B Kurkoski, H Yagi arXiv: 1107.5637 v1 [cs. IT], 2011 | 12 | 2011 |
| Reliability function and strong converse of biometrical identification systems V Yachongka, H Yagi 2016 International Symposium on Information Theory and Its Applications …, 2016 | 11 | 2016 |
| Finding the capacity of a quantized binary-input DMC BM Kurkoski, H Yagi 2012 IEEE International Symposium on Information Theory Proceedings, 686-690, 2012 | 11 | 2012 |
| Channel quantizers that maximize random coding exponents for binary-input memoryless channels H Yagi, BM Kurkoski 2012 IEEE International Conference on Communications (ICC), 2228-2232, 2012 | 11 | 2012 |
| Improved rate-equivocation regions for secure cooperative communication N Marina, H Yagi, HV Poor 2011 IEEE International Symposium on Information Theory Proceedings, 2871-2875, 2011 | 11 | 2011 |
| Variable-length resolvability for general sources H Yagi 2017 IEEE International Symposium on Information Theory (ISIT), 1748-1752, 2017 | 10 | 2017 |
| Single-letter characterization of epsilon-capacity for mixed memoryless channels H Yagi, R Nomura 2014 IEEE International Symposium on Information Theory, 2874-2878, 2014 | 10 | 2014 |
| Multi-level rate-splitting for synchronous and asynchronous interference channels H Yagi, HV Poor 2011 IEEE International Symposium on Information Theory Proceedings, 2080-2084, 2011 | 10 | 2011 |
| Fast algorithm for generating candidate codewords in reliability-based maximum likelihood decoding H Yagi, T Matsushima, S Hirasawa seed 2, 5, 2005 | 9 | 2005 |
| Identification, secrecy, template, and privacy-leakage of biometric identification system under noisy enrollment V Yachongka, H Yagi 2019 IEEE International Symposium on Information Theory (ISIT), 812-816, 2019 | 8 | 2019 |
| Variable-length coding with cost allowing non-vanishing error probability H Yagi, R Nomura IEICE Transactions on Fundamentals of Electronics, Communications and …, 2017 | 8 | 2017 |
| New traceability codes against a generalized collusion attack for digital fingerprinting H Yagi, T Matsushima, S Hirasawa Information Security Applications: 7th International Workshop, WISA 2006 …, 2007 | 8 | 2007 |
| Complexity reduction of the Gazelle and Snyders decoding algorithm for maximum likelihood decoding H YAGI, M KOBAYASHI, S HIRASAWA IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and …, 2003 | 8 | 2003 |
| Channel resolvability theorems for general sources and channels H Yagi 2017 IEEE International Symposium on Information Theory (ISIT), 2741-2745, 2017 | 7 | 2017 |
Brian KurkoskiAssociate Professor, Japan Advanced Institute of Science and TechnologyVerified email at jaist.ac.jp
