59 citations · 137 across the 5 of their papers we have counts for
6 papers
On Field Size and Success Probability in Network Coding
Olav Geil, Ryutaroh Matsumoto, Casper Thomsen
Using tools from algebraic geometry and Groebner basis theory we solve two problems in network coding. First we present a method to determine the smallest field size for which line…
Near ML detection using Dijkstra's algorithm with bounded list size over MIMO channels
Atsushi Okawado, Ryutaroh Matsumoto, Tomohiko Uyematsu
We propose Dijkstra's algorithm with bounded list size after QR decomposition for decreasing the computational complexity of near maximum-likelihood (ML) detection of signals over…
Tomography increases key rates of quantum-key-distribution protocols
Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu
We construct a practically implementable classical processing for the BB84 protocol and the six-state protocol that fully utilizes the accurate channel estimation method, which is…
Key rate available from mismatched mesurements in the BB84 protocol and the uncertainty principle
Ryutaroh Matsumoto, Shun Watanabe
We consider the mismatched measurements in the BB84 quantum key distribution protocol, in which measuring bases are different from transmitting bases. We give a lower bound on the…
Quantum multiparty key distribution protocol without use of entanglement
Ryutaroh Matsumoto
We propose a quantum key distribution (QKD) protocol that enables three parties agree at once on a shared common random bit string in presence of an eavesdropper without use of ent…
Constructing quantum error-correcting codes for p^m-state systems from classical error-correcting codes
Ryutaroh Matsumoto, Tomohiko Uyematsu
We generalize the construction of quantum error-correcting codes from GF(4)-linear codes by Calderbank et al. to p^m-state systems. Then we show how to determine the error from a s…