default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRyutaroh Matsumoto
松本 隆太郎
Person information
- unicode name: 松本 隆太郎
- affiliation: Nagoya University, Japan
- affiliation (PhD 2001): Tokyo Institute of Technology, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j47]Shogo Chiwaki, Ryutaroh Matsumoto:
Performance Comparison of the Two Reconstruction Methods for Stabilizer-Based Quantum Secret Sharing. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 107(3): 526-529 (2024)- [j46]Mamoru Shibata
, Ryutaroh Matsumoto:
Advance Sharing of Quantum Shares for Quantum Secrets. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 107(8): 1247-1254 (2024) - [i58]Ryutaroh Matsumoto:
General framework of breeding protocols for entanglement distillation. CoRR abs/2401.02265 (2024) - 2023
- [j45]Carlos Galindo, Fernando Hernando, Ryutaroh Matsumoto:
Steane enlargement of entanglement-assisted quantum error-correcting codes. Comput. Appl. Math. 42(6): 275 (2023) - [i57]Carlos Galindo, Fernando Hernando, Ryutaroh Matsumoto:
Steane enlargement of Entanglement-Assisted Quantum Error-Correcting Codes. CoRR abs/2303.03079 (2023) - 2022
- [j44]Rina Miyajima, Ryutaroh Matsumoto:
Advance Sharing of Quantum Shares for Classical Secrets. IEEE Access 10: 94458-94468 (2022) - [j43]Ryutaroh Matsumoto, Manabu Hagiwara:
Constructions of ℓ-Adic t-Deletion-Correcting Quantum Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(3): 571-575 (2022) - [i56]Daiki Ueno, Ryutaroh Matsumoto:
Explicit method to make shortened stabilizer EAQECC from stabilizer QECC. CoRR abs/2205.13732 (2022) - [i55]Rina Miyajima, Ryutaroh Matsumoto:
Advance sharing of quantum shares for classical secrets. CoRR abs/2208.01847 (2022) - 2021
- [j42]Ryutaroh Matsumoto, Manabu Hagiwara:
A Survey of Quantum Error Correction. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 104-A(12): 1654-1664 (2021) - [j41]Carlos Galindo, Fernando Hernando, Ryutaroh Matsumoto, Diego Ruano:
Correction to: Entanglement-assisted quantum error-correcting codes over arbitrary finite fields. Quantum Inf. Process. 20(6): 216 (2021) - [i54]Ryutaroh Matsumoto, Manabu Hagiwara:
Constructios of l-adic t-deletion-correcting quantum codes. CoRR abs/2102.04230 (2021) - [i53]Ryutaroh Matsumoto:
Lee Weight for Nonbinary Quantum Error Correction. CoRR abs/2105.12354 (2021) - 2020
- [j40]Carlos Galindo, Fernando Hernando, Ryutaroh Matsumoto, Diego Ruano:
Asymmetric Entanglement-Assisted Quantum Error-Correcting Codes and BCH Codes. IEEE Access 8: 18571-18579 (2020) - [j39]Koichiro Yamanaka, Ryutaroh Matsumoto, Keita Takahashi, Toshiaki Fujii:
Adversarial Patch Attacks on Monocular Depth Estimation Networks. IEEE Access 8: 179094-179104 (2020) - [j38]Ryutaroh Matsumoto:
Message randomization and strong security in quantum stabilizer-based secret sharing for classical secrets. Des. Codes Cryptogr. 88(9): 1893-1907 (2020) - [j37]Ryutaroh Matsumoto:
Classical access structures of ramp secret sharing based on quantum stabilizer codes. Quantum Inf. Process. 19(1): 9 (2020) - [i52]Ryutaroh Matsumoto:
Improved Gilbert-Varshamov Bound for Entanglement-Assisted Asymmetric Quantum Error Correction by Symplectic Orthogonality. CoRR abs/2003.00668 (2020) - [i51]Koichiro Yamanaka, Ryutaroh Matsumoto, Keita Takahashi, Toshiaki Fujii:
Adversarial Patch Attacks on Monocular Depth Estimation Networks. CoRR abs/2010.03072 (2020)
2010 – 2019
- 2019
- [j36]Ryutaroh Matsumoto:
Strongly secure quantum ramp secret sharing constructed from algebraic curves over finite fields. Adv. Math. Commun. 13(1): 1-10 (2019) - [j35]Carlos Galindo, Fernando Hernando, Ryutaroh Matsumoto, Diego Ruano:
Entanglement-assisted quantum error-correcting codes over arbitrary finite fields. Quantum Inf. Process. 18(4): 116 (2019) - [c33]Gembu Ito, Akinori Hosoyamada, Ryutaroh Matsumoto, Yu Sasaki, Tetsu Iwata:
Quantum Chosen-Ciphertext Attacks Against Feistel Ciphers. CT-RSA 2019: 391-411 - [i50]Ryutaroh Matsumoto:
Message Randomization and Strong Security in Quantum Stabilizer-Based Secret Sharing for Classical Secrets. CoRR abs/1904.11114 (2019) - [i49]Carlos Galindo, Fernando Hernando, Ryutaroh Matsumoto, Diego Ruano:
Asymmetric entanglement-assisted quantum error-correcting codes and BCH codes. CoRR abs/1911.10031 (2019) - 2018
- [j34]Carlos Galindo, Fernando Hernando, Ryutaroh Matsumoto:
Quasi-cyclic constructions of quantum codes. Finite Fields Their Appl. 52: 261-280 (2018) - [j33]Ryutaroh Matsumoto:
Coding Theoretic Construction of Quantum Ramp Secret Sharing. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(8): 1215-1222 (2018) - [j32]Umberto Martínez-Peñas, Ryutaroh Matsumoto:
Relative Generalized Matrix Weights of Matrix Codes for Universal Security on Wire-Tap Networks. IEEE Trans. Inf. Theory 64(4): 2529-2549 (2018) - [c32]Ryutaroh Matsumoto:
Exploring Quantum Supremacy in Access Structures of Secret Sharing by Coding Theory. ISITA 2018: 331-333 - [i48]Ryutaroh Matsumoto:
Exploring Quantum Supremacy in Access Structures of Secret Sharing by Coding Theory. CoRR abs/1803.10392 (2018) - [i47]Ryutaroh Matsumoto:
Introducing the Perception-Distortion Tradeoff into the Rate-Distortion Theory of General Information Sources. CoRR abs/1808.07986 (2018) - [i46]Ryutaroh Matsumoto:
Classical Access Structures of Ramp Secret Sharing Based on Quantum Stabilizer Codes. CoRR abs/1811.05217 (2018) - [i45]Carlos Galindo, Fernando Hernando, Ryutaroh Matsumoto, Diego Ruano:
Entanglement-assisted quantum error-correcting codes over arbitrary finite fields. CoRR abs/1812.05312 (2018) - [i44]Ryutaroh Matsumoto:
Rate-Distortion-Perception Tradeoff of Variable-Length Source Coding for General Information Sources. CoRR abs/1812.11822 (2018) - [i43]Gembu Ito, Akinori Hosoyamada, Ryutaroh Matsumoto, Yu Sasaki, Tetsu Iwata:
Quantum Chosen-Ciphertext Attacks against Feistel Ciphers. IACR Cryptol. ePrint Arch. 2018: 1193 (2018) - 2017
- [j31]Ryutaroh Matsumoto:
Quantum Optimal Multiple Assignment Scheme for Realizing General Access Structure of Secret Sharing. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(2): 726-728 (2017) - [j30]Olav Geil, Stefano Martin, Umberto Martínez-Peñas, Ryutaroh Matsumoto, Diego Ruano:
On Asymptotically Good Ramp Secret Sharing Schemes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(12): 2699-2708 (2017) - [j29]Ryutaroh Matsumoto:
Quantum Stabilizer Codes Can Realize Access Structures Impossible by Classical Secret Sharing. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(12): 2738-2739 (2017) - [j28]Ryutaroh Matsumoto, Diego Ruano, Olav Geil:
List decoding algorithm based on voting in Gröbner bases for general one-point AG codes. J. Symb. Comput. 79: 384-410 (2017) - [j27]Ryutaroh Matsumoto:
Unitary reconstruction of secret for stabilizer-based quantum secret sharing. Quantum Inf. Process. 16(8): 202 (2017) - [j26]Ryutaroh Matsumoto:
Two Gilbert-Varshamov-type existential bounds for asymmetric quantum error-correcting codes. Quantum Inf. Process. 16(12): 285 (2017) - [j25]Ryutaroh Matsumoto, Masahito Hayashi:
Universal Secure Multiplex Network Coding With Dependent and Non-Uniform Messages. IEEE Trans. Inf. Theory 63(6): 3773-3782 (2017) - [i42]Ryutaroh Matsumoto:
Unitary Reconstruction of Secret for Stabilizer Based Quantum Secret Sharing. CoRR abs/1701.02054 (2017) - [i41]Ryutaroh Matsumoto:
Quantum Stabilizer Codes Can Realize Access Structures Impossible by Classical Secret Sharing. CoRR abs/1701.02911 (2017) - [i40]Ryutaroh Matsumoto:
Quantum Optimal Multiple Assignment Scheme for Realizing General Access Structure of Secret Sharing. CoRR abs/1702.00942 (2017) - [i39]Ryutaroh Matsumoto:
Two Gilbert-Varshamov Type Existential Bounds for Asymmetric Quantum Error-Correcting Codes. CoRR abs/1705.04087 (2017) - [i38]Carlos Galindo, Fernando Hernando, Ryutaroh Matsumoto:
Quasi-Cyclic Constructions of Quantum Codes. CoRR abs/1712.06907 (2017) - 2016
- [j24]Masahito Hayashi, Ryutaroh Matsumoto:
Secure Multiplex Coding With Dependent and Non-Uniform Multiple Messages. IEEE Trans. Inf. Theory 62(5): 2355-2409 (2016) - [c31]Umberto Martínez-Peñas, Ryutaroh Matsumoto:
Unifying notions of generalized weights for universal security on wire-tap networks. Allerton 2016: 800-807 - [i37]Umberto Martínez-Peñas, Ryutaroh Matsumoto:
Unifying notions of generalized weights for universal security on wire-tap networks. CoRR abs/1607.01263 (2016) - [i36]Umberto Martínez-Peñas, Ryutaroh Matsumoto:
Relative generalized matrix weights of matrix codes for universal security on wire-tap networks. CoRR abs/1612.01888 (2016) - 2015
- [j23]Ryutaroh Matsumoto:
Strong Security of the Strongly Multiplicative Ramp Secret Sharing Based on Algebraic Curves. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(7): 1576-1578 (2015) - [j22]Paul Zhang, Ryutaroh Matsumoto:
Quantum strongly secure ramp secret sharing. Quantum Inf. Process. 14(2): 715-729 (2015) - [j21]Jun Kurihara, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding. IEEE Trans. Inf. Theory 61(7): 3912-3936 (2015) - [c30]Hiroaki Sasaki, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Key rate of the B92 quantum key distribution protocol with finite qubits. ISIT 2015: 696-699 - [i35]Olav Geil, Stefano Martin, Umberto Martínez-Peñas, Ryutaroh Matsumoto, Diego Ruano:
Asymptotically good ramp secret sharing schemes. CoRR abs/1502.05507 (2015) - [i34]Hiroaki Sasaki, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Key Rate of the B92 Quantum Key Distribution Protocol with Finite Qubits. CoRR abs/1504.05628 (2015) - [i33]Ryutaroh Matsumoto:
Strong Security of the Strongly Multiplicative Ramp Secret Sharing based on Algebraic Curves. IACR Cryptol. ePrint Arch. 2015: 662 (2015) - 2014
- [j20]Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Optimal axis compensation in quantum key distribution protocols over unital channels. Theor. Comput. Sci. 560: 91-106 (2014) - [j19]Olav Geil, Stefano Martin, Ryutaroh Matsumoto, Diego Ruano, Yuan Luo:
Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes. IEEE Trans. Inf. Theory 60(10): 5938-5949 (2014) - [c29]Ryutaroh Matsumoto:
New asymptotic metrics for relative generalized Hamming weight. ISIT 2014: 3142-3144 - [c28]Ryutaroh Matsumoto:
Coding theoretic study of secure network coding and quantum secret sharing. ISITA 2014: 335-337 - [c27]Hokuto Takahashi, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Maximum multicast throughput by network coding on undirected hypernetworks. ISITA 2014: 363-367 - [c26]Olav Geil, Stefano Martin, Ryutaroh Matsumoto, Diego Ruano, Yuan Luo:
Relative generalized Hamming weights of one-point algebraic geometric codes. ITW 2014: 137-141 - [i32]Olav Geil, Stefano Martin, Ryutaroh Matsumoto, Diego Ruano, Yuan Luo:
Relative generalized Hamming weights of one-point algebraic geometric codes. CoRR abs/1403.7985 (2014) - [i31]Ryutaroh Matsumoto:
New Asymptotic Metrics for Relative Generalized Hamming Weight. CoRR abs/1404.0434 (2014) - [i30]Ryutaroh Matsumoto:
Coding Theoretic Construction of Quantum Ramp Secret Sharing. CoRR abs/1405.0149 (2014) - [i29]Ryutaroh Matsumoto:
Strongly Secure Quantum Ramp Secret Sharing Constructed from Algebraic Curves over Finite Fields. CoRR abs/1410.5126 (2014) - [i28]Ryutaroh Matsumoto:
Coding Theoretic Construction of Quantum Ramp Secret Sharing. IACR Cryptol. ePrint Arch. 2014: 322 (2014) - 2013
- [j18]Olav Geil, Ryutaroh Matsumoto, Diego Ruano:
Feng-Rao decoding of primary codes. Finite Fields Their Appl. 23: 35-52 (2013) - [j17]Ryutaroh Matsumoto, Diego Ruano, Olav Geil:
Generalization of the Lee-O'Sullivan list decoding for one-point AG codes. J. Symb. Comput. 55: 1-9 (2013) - [c25]Ryutaroh Matsumoto:
Improved asymptotic key rate of the B92 protocol. ISIT 2013: 351-353 - [i27]Ryutaroh Matsumoto:
Improved Asymptotic Key Rate of the B92 Protocol. CoRR abs/1301.5083 (2013) - [i26]Jun Kurihara, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding. CoRR abs/1301.5482 (2013) - 2012
- [j16]Jun Kurihara, Tomohiko Uyematsu, Ryutaroh Matsumoto:
Secret Sharing Schemes Based on Linear Codes Can Be Precisely Characterized by the Relative Generalized Hamming Weight. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 95-A(11): 2067-2075 (2012) - [j15]Tetsunao Matsuta, Tomohiko Uyematsu, Ryutaroh Matsumoto:
Parametric Forms of the Achievable Rate Region for Source Coding with a Helper. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 95-A(12): 2493-2497 (2012) - [c24]Jun Kurihara, Tomohiko Uyematsu, Ryutaroh Matsumoto:
New parameters of linear codes expressing security performance of universal secure network coding. Allerton Conference 2012: 533-540 - [c23]Masahito Hayashi, Ryutaroh Matsumoto:
Secure multiplex coding with dependent and non-uniform multiple messages. Allerton Conference 2012: 954-959 - [c22]Olav Geil, Ryutaroh Matsumoto, Diego Ruano:
List decoding algorithms based on Gröbner bases for general one-point AG codes. ISIT 2012: 86-90 - [c21]Jun Kurihara, Tomohiko Uyematsu, Ryutaroh Matsumoto:
Explicit construction of universal strongly secure network coding via MRD codes. ISIT 2012: 1483-1487 - [c20]Olav Geil, Stefano Martin, Ryutaroh Matsumoto:
A New Method for Constructing Small-Bias Spaces from Hermitian Codes. WAIFI 2012: 29-44 - [i25]Olav Geil, Ryutaroh Matsumoto, Diego Ruano:
List Decoding Algorithms based on Gröbner Bases for General One-Point AG Codes. CoRR abs/1201.6248 (2012) - [i24]Masahito Hayashi, Ryutaroh Matsumoto:
Secure Multiplex Coding with Dependent and Non-Uniform Multiple Messages. CoRR abs/1202.1332 (2012) - [i23]Olav Geil, Ryutaroh Matsumoto, Diego Ruano:
List Decoding Algorithm based on Voting in Groebner Bases for General One-Point AG Codes. CoRR abs/1203.6127 (2012) - [i22]Olav Geil, Ryutaroh Matsumoto, Diego Ruano:
Generalization of the Lee-O'Sullivan List Decoding for One-Point AG Codes. CoRR abs/1203.6129 (2012) - [i21]Jun Kurihara, Tomohiko Uyematsu, Ryutaroh Matsumoto:
New Parameters of Linear Codes Expressing Security Performance of Universal Secure Network Coding. CoRR abs/1207.1936 (2012) - [i20]Olav Geil, Ryutaroh Matsumoto, Diego Ruano:
Feng-Rao decoding of primary codes. CoRR abs/1210.6722 (2012) - 2011
- [c19]Masahito Hayashi, Ryutaroh Matsumoto:
Universally attainable error and information exponents, and equivocation rate for the broadcast channels with confidential messages. Allerton 2011: 439-444 - [c18]Ryutaroh Matsumoto, Masahito Hayashi:
Secure multiplex coding with a common message. ISIT 2011: 1965-1969 - [i19]Ryutaroh Matsumoto, Masahito Hayashi:
Secure Multiplex Coding with a Common Message. CoRR abs/1101.4036 (2011) - [i18]Ryutaroh Matsumoto, Masahito Hayashi:
Secure Multiplex Network Coding. CoRR abs/1102.3002 (2011) - [i17]Masahito Hayashi, Ryutaroh Matsumoto:
Universally Attainable Error and Information Exponents for the Broadcast Channels with Confidential Messages. CoRR abs/1104.4285 (2011) - [i16]Xiaolin Li, Ryutaroh Matsumoto:
Secure Multiplex Coding Over Interference Channel with Confidential Messages. CoRR abs/1109.4074 (2011) - [i15]Ryutaroh Matsumoto, Masahito Hayashi:
Universal Strongly Secure Network Coding with Dependent and Non-Uniform Messages. CoRR abs/1111.4174 (2011) - 2010
- [j14]Jasper Goseling, Ryutaroh Matsumoto, Tomohiko Uyematsu, Jos H. Weber:
Lower Bounds on the Maximum Energy Benefit of Network Coding for Wireless Multiple Unicast. EURASIP J. Wirel. Commun. Netw. 2010 (2010) - [j13]Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(9): 1650-1659 (2010) - [j12]Tetsunao Matsuta, Tomohiko Uyematsu, Ryutaroh Matsumoto:
Universal Slepian-Wolf Source Codes Using Low-Density Parity-Check Matrices. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(11): 1878-1888 (2010) - [j11]Eitaro Shioji, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Vulnerability of MRD-Code-based Universal Secure Network Coding against Stronger Eavesdroppers. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(11): 2026-2033 (2010) - [c17]Kenta Kasai, Takayuki Tsujimoto, Ryutaroh Matsumoto, Kohichi Sakaniwa:
Rate-Compatible Slepian-Wolf Coding with Short Non-Binary LDPC Codes. DCC 2010: 288-296 - [c16]Tetsunao Matsuta, Tomohiko Uyematsu, Ryutaroh Matsumoto:
Universal Slepian-Wolf source codes using low-density parity-check matrices. ISIT 2010: 186-190 - [c15]Eitaro Shioji, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Vulnerability of MRD-code-based universal secure network coding against stronger eavesdroppers. ISIT 2010: 2433-2437 - [c14]Masahito Hayashi, Ryutaroh Matsumoto:
Construction of wiretap codes from ordinary channel codes. ISIT 2010: 2538-2542 - [c13]Y. Sano, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Secure key rate of the BB84 protocol using finite sample bits. ISIT 2010: 2677-2681 - [c12]Kenta Kasai, Ryutaroh Matsumoto, Kohichi Sakaniwa:
Information reconciliation for QKD with rate-compatible non-binary LDPC codes. ISITA 2010: 922-927 - [i14]Masahito Hayashi, Ryutaroh Matsumoto:
Construction of wiretap codes from ordinary channel codes. CoRR abs/1001.1197 (2010) - [i13]Eitaro Shioji, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Vulnerability of MRD-Code-based Universal Secure Network Coding against Stronger Eavesdroppers. CoRR abs/1003.1787 (2010) - [i12]Ryutaroh Matsumoto, Masahito Hayashi:
Strong security and separated code constructions for the broadcast channels with confidential messages. CoRR abs/1010.0743 (2010)
2000 – 2009
- 2009
- [j10]Masashi Naito, Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Secret Key Agreement by Soft-Decision of Signals in Gaussian Maurer's Model. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(2): 525-534 (2009) - [j9]Terumasa Tateno, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Decodability of Network Coding with Time-Varying Delay and No Buffering. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(8): 2141-2145 (2009) - [c11]Tetsunao Matsuta, Tomohiko Uyematsu, Ryutaroh Matsumoto:
Closed forms of the achievable rate region for Wyner's source coding systems. ISIT 2009: 1214-1218 - [c10]Shun Watanabe, Tsuki Saitou, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Strongly secure privacy amplification cannot be obtained by encoder of Slepian-Wolf code. ISIT 2009: 1298-1302 - [c9]Tomohiko Uyematsu, Shun Watanabe, Ryutaroh Matsumoto:
Optimal axis compensation in quantum key distribution protocols over unital channels. ISIT 2009: 1884-1888 - [c8]Jasper Goseling, Ryutaroh Matsumoto, Tomohiko Uyematsu, Jos H. Weber:
On the energy benefit of network coding for wireless multiple unicast. ISIT 2009: 2567-2571 - [p1]Ryutaroh Matsumoto:
Radical Computation for Small Characteristics. Gröbner Bases, Coding, and Cryptography 2009: 427-430 - [i11]Jasper Goseling, Ryutaroh Matsumoto, Tomohiko Uyematsu, Jos H. Weber:
On the Energy Benefit of Network Coding for Wireless Multiple Unicast. CoRR abs/0901.2410 (2009) - [i10]Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code. CoRR abs/0906.2582 (2009) - [i9]Ryutaroh Matsumoto:
Problems in application of LDPC codes to information reconciliation in quantum key distribution protocols. CoRR abs/0908.2042 (2009) - 2008
- [j8]Ryutaroh Matsumoto, Shun Watanabe:
Key Rate Available from Mismatched Measurements in the BB84 Protocol and the Uncertainty Principle. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(10): 2870-2873 (2008) - [c7]Masashi Naito, Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Secret key agreement by reliability information of signals in Gaussian Maurer's Model. ISIT 2008: 727-731 - [c6]Atsushi Okawado, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Near ML detection using Dijkstra's algorithm with bounded list size over MIMO channels. ISIT 2008: 2022-2025 - [c5]Olav Geil, Ryutaroh Matsumoto, Casper Thomsen:
On Field Size and Success Probability in Network Coding. WAIFI 2008: 157-173 - [i8]Atsushi Okawado, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Near ML detection using Dijkstra's algorithm with bounded list size over MIMO channels. CoRR abs/0802.1785 (2008) - [i7]Masashi Naito, Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Secret Key Agreement by Soft-decision of Signals in Gaussian Maurer's Model. CoRR abs/0804.2940 (2008) - [i6]Olav Geil, Ryutaroh Matsumoto, Casper Thomsen:
On Field Size and Success Probability in Network Coding. CoRR abs/0806.4510 (2008) - 2007
- [j7]Ryutaroh Matsumoto:
Construction Algorithm for Network Error-Correcting Codes Attaining the Singleton Bound. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(9): 1729-1735 (2007) - [c4]Olav Geil, Ryutaroh Matsumoto:
Generalized Sudan's List Decoding for Order Domain Codes. AAECC 2007: 50-59 - [c3]Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu, Yasuhito Kawano:
Key rate of quantum key distribution with hashed two-way classical communication. ISIT 2007: 2601-2605 - 2006
- [j6]Ryutaroh Matsumoto, Kaoru Kurosawa, Toshiya Itoh, Toshimitsu Konno, Tomohiko Uyematsu:
Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography. IEEE Trans. Inf. Theory 52(9): 4251-4256 (2006) - [i5]Ryutaroh Matsumoto:
Construction algorithm for network error-correcting codes attaining the Singleton bound. CoRR abs/cs/0610121 (2006) - 2005
- [j5]Kouya Tochikubo, Tomohiko Uyematsu, Ryutaroh Matsumoto:
Efficient Secret Sharing Schemes Based on Authorized Subsets. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(1): 322-326 (2005) - [c2]Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Noise tolerance of the BB84 protocol with random privacy amplification. ISIT 2005: 1013-1017 - [i4]Ryutaroh Matsumoto, Kaoru Kurosawa, Toshiya Itoh, Toshimitsu Konno, Tomohiko Uyematsu:
Primal-dual distance bounds of linear codes with application to cryptography. CoRR abs/cs/0506087 (2005) - [i3]Ryutaroh Matsumoto, Kaoru Kurosawa, Toshiya Itoh, Toshimitsu Konno, Tomohiko Uyematsu:
Primal-Dual Distance Bounds of Linear Codes with Application to Cryptography. IACR Cryptol. ePrint Arch. 2005: 194 (2005) - 2004
- [j4]Kaoru Kurosawa, Ryutaroh Matsumoto:
Almost security of cryptographic Boolean functions. IEEE Trans. Inf. Theory 50(11): 2752-2761 (2004) - [i2]Takayuki Fukatani, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder. CoRR cs.IT/0410040 (2004) - [i1]Kenji Tanaka, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Maximum Mutual Information of Space-Time Block Codes with Symbolwise Decodability. CoRR cs.IT/0410041 (2004) - 2002
- [j3]Ryutaroh Matsumoto:
Improvement of Ashikhmin-Litsyn-Tsfasman bound for quantum codes. IEEE Trans. Inf. Theory 48(7): 2122-2124 (2002) - 2001
- [j2]Ryutaroh Matsumoto:
Computing the Radical of an Ideal in Positive Characteristic. J. Symb. Comput. 32(3): 263-271 (2001) - 2000
- [j1]Ryutaroh Matsumoto, Shinji Miura:
Finding a Basis of a Linear System with Pairwise Distinct Discrete Valuations on an Algebraic Curve. J. Symb. Comput. 30(3): 309-323 (2000)
1990 – 1999
- 1999
- [c1]Ryutaroh Matsumoto, Shinji Miura:
Computing a Basis of L(D) on an Affine Algebraic Curve with One Rational Place at Infinity. AAECC 1999: 271-281
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
