Ryutaroh Matsumoto

Orcid: 0000-0002-5085-8879

Affiliations:
  • Nagoya University, Japan
  • Tokyo Institute of Technology, Japan (PhD 2001)


According to our database1, Ryutaroh Matsumoto authored at least 92 papers between 1999 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Advance Sharing of Quantum Shares for Quantum Secrets.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2024

Performance Comparison of the Two Reconstruction Methods for Stabilizer-Based Quantum Secret Sharing.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2024

General framework of breeding protocols for entanglement distillation.
CoRR, 2024

2023
Steane enlargement of entanglement-assisted quantum error-correcting codes.
Comput. Appl. Math., September, 2023

2022
Constructions of <i>ℓ</i>-Adic <i>t</i>-Deletion-Correcting Quantum Codes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022

Explicit method to make shortened stabilizer EAQECC from stabilizer QECC.
CoRR, 2022

Advance Sharing of Quantum Shares for Classical Secrets.
IEEE Access, 2022

2021
Correction to: Entanglement-assisted quantum error-correcting codes over arbitrary finite fields.
Quantum Inf. Process., 2021

A Survey of Quantum Error Correction.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

Lee Weight for Nonbinary Quantum Error Correction.
CoRR, 2021

Constructios of l-adic t-deletion-correcting quantum codes.
CoRR, 2021

2020
Classical access structures of ramp secret sharing based on quantum stabilizer codes.
Quantum Inf. Process., 2020

Message randomization and strong security in quantum stabilizer-based secret sharing for classical secrets.
Des. Codes Cryptogr., 2020

Improved Gilbert-Varshamov Bound for Entanglement-Assisted Asymmetric Quantum Error Correction by Symplectic Orthogonality.
CoRR, 2020

Adversarial Patch Attacks on Monocular Depth Estimation Networks.
IEEE Access, 2020

Asymmetric Entanglement-Assisted Quantum Error-Correcting Codes and BCH Codes.
IEEE Access, 2020

2019
Entanglement-assisted quantum error-correcting codes over arbitrary finite fields.
Quantum Inf. Process., 2019

Strongly secure quantum ramp secret sharing constructed from algebraic curves over finite fields.
Adv. Math. Commun., 2019

2018
Relative Generalized Matrix Weights of Matrix Codes for Universal Security on Wire-Tap Networks.
IEEE Trans. Inf. Theory, 2018

Coding Theoretic Construction of Quantum Ramp Secret Sharing.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

Quantum Chosen-Ciphertext Attacks against Feistel Ciphers.
IACR Cryptol. ePrint Arch., 2018

Quasi-cyclic constructions of quantum codes.
Finite Fields Their Appl., 2018

Rate-Distortion-Perception Tradeoff of Variable-Length Source Coding for General Information Sources.
CoRR, 2018

Introducing the Perception-Distortion Tradeoff into the Rate-Distortion Theory of General Information Sources.
CoRR, 2018

Exploring Quantum Supremacy in Access Structures of Secret Sharing by Coding Theory.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

2017
Universal Secure Multiplex Network Coding With Dependent and Non-Uniform Messages.
IEEE Trans. Inf. Theory, 2017

Unitary reconstruction of secret for stabilizer-based quantum secret sharing.
Quantum Inf. Process., 2017

Two Gilbert-Varshamov-type existential bounds for asymmetric quantum error-correcting codes.
Quantum Inf. Process., 2017

List decoding algorithm based on voting in Gröbner bases for general one-point AG codes.
J. Symb. Comput., 2017

Quantum Stabilizer Codes Can Realize Access Structures Impossible by Classical Secret Sharing.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

Quantum Optimal Multiple Assignment Scheme for Realizing General Access Structure of Secret Sharing.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

On Asymptotically Good Ramp Secret Sharing Schemes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

2016
Secure Multiplex Coding With Dependent and Non-Uniform Multiple Messages.
IEEE Trans. Inf. Theory, 2016

Unifying notions of generalized weights for universal security on wire-tap networks.
Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2015
Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding.
IEEE Trans. Inf. Theory, 2015

Quantum strongly secure ramp secret sharing.
Quantum Inf. Process., 2015

Strong Security of the Strongly Multiplicative Ramp Secret Sharing Based on Algebraic Curves.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

Key rate of the B92 quantum key distribution protocol with finite qubits.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes.
IEEE Trans. Inf. Theory, 2014

Optimal axis compensation in quantum key distribution protocols over unital channels.
Theor. Comput. Sci., 2014

Maximum multicast throughput by network coding on undirected hypernetworks.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

Coding theoretic study of secure network coding and quantum secret sharing.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

New asymptotic metrics for relative generalized Hamming weight.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Generalization of the Lee-O'Sullivan list decoding for one-point AG codes.
J. Symb. Comput., 2013

Feng-Rao decoding of primary codes.
Finite Fields Their Appl., 2013

Improved asymptotic key rate of the B92 protocol.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Parametric Forms of the Achievable Rate Region for Source Coding with a Helper.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012

Secret Sharing Schemes Based on Linear Codes Can Be Precisely Characterized by the Relative Generalized Hamming Weight.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012

List Decoding Algorithm based on Voting in Groebner Bases for General One-Point AG Codes
CoRR, 2012

A New Method for Constructing Small-Bias Spaces from Hermitian Codes.
Proceedings of the Arithmetic of Finite Fields - 4th International Workshop, 2012

Explicit construction of universal strongly secure network coding via MRD codes.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

List decoding algorithms based on Gröbner bases for general one-point AG codes.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

New parameters of linear codes expressing security performance of universal secure network coding.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011
Universal Strongly Secure Network Coding with Dependent and Non-Uniform Messages
CoRR, 2011

Secure Multiplex Coding Over Interference Channel with Confidential Messages
CoRR, 2011

Universally Attainable Error and Information Exponents for the Broadcast Channels with Confidential Messages
CoRR, 2011

Secure Multiplex Network Coding
CoRR, 2011

Secure multiplex coding with a common message.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Universally attainable error and information exponents, and equivocation rate for the broadcast channels with confidential messages.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010
Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010

Vulnerability of MRD-Code-based Universal Secure Network Coding against Stronger Eavesdroppers.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010

Universal Slepian-Wolf Source Codes Using Low-Density Parity-Check Matrices.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010

Lower Bounds on the Maximum Energy Benefit of Network Coding for Wireless Multiple Unicast.
EURASIP J. Wirel. Commun. Netw., 2010

Strong security and separated code constructions for the broadcast channels with confidential messages
CoRR, 2010

Information reconciliation for QKD with rate-compatible non-binary LDPC codes.
Proceedings of the International Symposium on Information Theory and its Applications, 2010

Secure key rate of the BB84 protocol using finite sample bits.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Construction of wiretap codes from ordinary channel codes.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Rate-Compatible Slepian-Wolf Coding with Short Non-Binary LDPC Codes.
Proceedings of the 2010 Data Compression Conference (DCC 2010), 2010

2009
Decodability of Network Coding with Time-Varying Delay and No Buffering.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009

Secret Key Agreement by Soft-Decision of Signals in Gaussian Maurer's Model.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009

Problems in application of LDPC codes to information reconciliation in quantum key distribution protocols
CoRR, 2009

Strongly secure privacy amplification cannot be obtained by encoder of Slepian-Wolf code.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Closed forms of the achievable rate region for Wyner's source coding systems.
Proceedings of the IEEE International Symposium on Information Theory, 2009

On the energy benefit of network coding for wireless multiple unicast.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Radical Computation for Small Characteristics.
Proceedings of the Gröbner Bases, Coding, and Cryptography, 2009

2008
Key Rate Available from Mismatched Measurements in the BB84 Protocol and the Uncertainty Principle.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

On Field Size and Success Probability in Network Coding.
Proceedings of the Arithmetic of Finite Fields, 2nd International Workshop, 2008

Near ML detection using Dijkstra's algorithm with bounded list size over MIMO channels.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Secret key agreement by reliability information of signals in Gaussian Maurer's Model.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
Construction Algorithm for Network Error-Correcting Codes Attaining the Singleton Bound.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007

Key rate of quantum key distribution with hashed two-way classical communication.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Generalized Sudan's List Decoding for Order Domain Codes.
Proceedings of the Applied Algebra, 2007

2006
Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography.
IEEE Trans. Inf. Theory, 2006

2005
Efficient Secret Sharing Schemes Based on Authorized Subsets.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

Noise tolerance of the BB84 protocol with random privacy amplification.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
Almost security of cryptographic Boolean functions.
IEEE Trans. Inf. Theory, 2004

Maximum Mutual Information of Space-Time Block Codes with Symbolwise Decodability
CoRR, 2004

Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder
CoRR, 2004

2002
Improvement of Ashikhmin-Litsyn-Tsfasman bound for quantum codes.
IEEE Trans. Inf. Theory, 2002

2001
Computing the Radical of an Ideal in Positive Characteristic.
J. Symb. Comput., 2001

2000
Finding a Basis of a Linear System with Pairwise Distinct Discrete Valuations on an Algebraic Curve.
J. Symb. Comput., 2000

1999
Computing a Basis of L(D) on an Affine Algebraic Curve with One Rational Place at Infinity.
Proceedings of the Applied Algebra, 1999


  Loading...