Ryutaroh Matsumoto
Ryutaroh Matsumoto
Department of Information and Communication Engineering, Nagoya University, Japan
Verified email at nagoya-u.jp - Homepage
TitleCited byYear
Secure multiplex coding with dependent and non-uniform multiple messages
M Hayashi, R Matsumoto
IEEE Transactions on Information Theory 62 (5), 2355-2409, 2016
582016
Improvement of Ashikhmin-Litsyn-Tsfasman bound for quantum codes
R Matsumoto
IEEE Transactions on Information Theory 48 (7), 2122-2124, 2002
512002
Construction algorithm for network error-correcting codes attaining the singleton bound
R Matsumoto
IEICE Transactions on Fundamentals of Electronics, Communications and …, 2007
502007
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
46*2000
Tomography increases key rates of quantum-key-distribution protocols
S Watanabe, R Matsumoto, T Uyematsu
Physical Review A 78 (4), 042316, 2008
392008
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
382015
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
382007
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
382004
Computing the radical of an ideal in positive characteristic
R Matsumoto
Journal of Symbolic Computation 32 (3), 263-271, 2001
362001
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
361999
Multiparty quantum-key-distribution protocol without use of entanglement
R Matsumoto
Physical Review A 76 (6), 062316, 2007
352007
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
342012
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
332014
Construction of wiretap codes from ordinary channel codes
M Hayashi, R Matsumoto
2010 IEEE International Symposium on Information Theory, 2538-2542, 2010
322010
Efficient secret sharing schemes based on authorized subsets
K Tochikubo, T Uyematsu, R Matsumoto
IEICE Transactions on Fundamentals of Electronics, Communications and …, 2005
322005
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
292010
Almost security of cryptographic Boolean functions
K Kurosawa, R Matsumoto
IEEE Transactions on Information Theory 50 (11), 2752-2761, 2004
29*2004
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
272000
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
262010
Conversion of a general quantum stabilizer code to an entanglement distillation protocol
R Matsumoto
Journal of Physics A: Mathematical and General 36 (29), 8113, 2003
252003
The system can't perform the operation now. Try again later.
Articles 1–20