| Secure multiplex coding with dependent and non-uniform multiple messages M Hayashi, R Matsumoto IEEE Transactions on Information Theory 62 (5), 2355-2409, 2016 | 61 | 2016 |
| Improvement of Ashikhmin-Litsyn-Tsfasman bound for quantum codes R Matsumoto IEEE Transactions on Information Theory 48 (7), 2122-2124, 2002 | 52 | 2002 |
| Construction algorithm for network error-correcting codes attaining the singleton bound R Matsumoto IEICE Transactions on Fundamentals of Electronics, Communications and …, 2007 | 51 | 2007 |
| Constructing quantum error-correcting codes for p m-state systems from classical error-correcting codes R Matsumoto, T Uyematsu IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and …, 2000 | 49* | 2000 |
| Tomography increases key rates of quantum-key-distribution protocols S Watanabe, R Matsumoto, T Uyematsu Physical Review A 78 (4), 042316, 2008 | 43 | 2008 |
| Relative generalized rank weight of linear codes and its applications to network coding J Kurihara, R Matsumoto, T Uyematsu IEEE Transactions On information theory 61 (7), 3912-3936, 2015 | 39 | 2015 |
| Key rate of quantum key distribution with hashed two-way classical communication S Watanabe, R Matsumoto, T Uyematsu, Y Kawano Physical Review A 76 (3), 032312, 2007 | 39 | 2007 |
| Two methods for decreasing the computational complexity of the MIMO ML decoder T Fukatani, R Matsumoto, T Uyematsu IEICE Transactions on Fundamentals of Electronics, Communications and …, 2004 | 39 | 2004 |
| Multiparty quantum-key-distribution protocol without use of entanglement R Matsumoto Physical Review A 76 (6), 062316, 2007 | 38 | 2007 |
| Relative generalized Hamming weights of one-point algebraic geometric codes O Geil, S Martin, R Matsumoto, D Ruano, Y Luo IEEE Transactions on Information Theory 60 (10), 5938-5949, 2014 | 37 | 2014 |
| Secret sharing schemes based on linear codes can be precisely characterized by the relative generalized Hamming weight J Kurihara, T Uyematsu, R Matsumoto IEICE Transactions on Fundamentals of Electronics, Communications and …, 2012 | 36 | 2012 |
| Computing the radical of an ideal in positive characteristic R Matsumoto Journal of Symbolic Computation 32 (3), 263-271, 2001 | 36 | 2001 |
| Miura's Generalization of One-Point AG Codes is Equivalent to Hφholdt, van Lint and Pellikaan's Generalization R Matsumoto IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and …, 1999 | 36 | 1999 |
| Efficient secret sharing schemes based on authorized subsets K Tochikubo, T Uyematsu, R Matsumoto IEICE Transactions on Fundamentals of Electronics, Communications and …, 2005 | 35 | 2005 |
| Construction of wiretap codes from ordinary channel codes M Hayashi, R Matsumoto 2010 IEEE International Symposium on Information Theory, 2538-2542, 2010 | 34 | 2010 |
| Information reconciliation for QKD with rate-compatible non-binary LDPC codes K Kasai, R Matsumoto, K Sakaniwa 2010 International Symposium On Information Theory & Its Applications, 922-927, 2010 | 30 | 2010 |
| Almost security of cryptographic Boolean functions K Kurosawa, R Matsumoto IEEE Transactions on Information Theory 50 (11), 2752-2761, 2004 | 29* | 2004 |
| Secure key rate of the BB84 protocol using finite sample bits Y Sano, R Matsumoto, T Uyematsu Journal of Physics A: Mathematical and Theoretical 43 (49), 495302, 2010 | 28 | 2010 |
| On the Feng-Rao bound for the L-construction of algebraic geometry codes R Matsumoto, S Miura IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and …, 2000 | 27 | 2000 |
| Lower bound for the quantum capacity of a discrete memoryless quantum channel R Matsumoto, T Uyematsu Journal of Mathematical Physics 43 (9), 4391-4403, 2002 | 26 | 2002 |
Shun WatanabeAssociate Professor, Tokyo University of Agriculture and TechnologyVerified email at cc.tuat.ac.jp
