The following pages link to Ryutaroh Matsumoto (Q207166):
Displaying 41 items.
- Generalization of the Lee-O'Sullivan list decoding for one-point AG codes (Q390381) (← links)
- Optimal axis compensation in quantum key distribution protocols over unital channels (Q477176) (← links)
- List decoding algorithm based on voting in Gröbner bases for general one-point AG codes (Q507148) (← links)
- Entanglement-assisted quantum error-correcting codes over arbitrary finite fields (Q670071) (← links)
- Bounding the number of \(\mathbb F_q\)-rational places in algebraic function fields using Weierstrass semigroups (Q1008764) (← links)
- Finding a basis of a linear system with pairwise distinct discrete valuations on an algebraic curve (Q1587232) (← links)
- Quasi-cyclic constructions of quantum codes (Q1637199) (← links)
- Two Gilbert-Varshamov-type existential bounds for asymmetric quantum error-correcting codes (Q1698783) (← links)
- Unitary reconstruction of secret for stabilizer-based quantum secret sharing (Q1700012) (← links)
- Strongly secure quantum ramp secret sharing constructed from algebraic curves over finite fields (Q1726005) (← links)
- Quantum strongly secure ramp secret sharing (Q2018190) (← links)
- Message randomization and strong security in quantum stabilizer-based secret sharing for classical secrets (Q2200519) (← links)
- Quantum chosen-ciphertext attacks against Feistel ciphers (Q2290464) (← links)
- Feng-Rao decoding of primary codes (Q2447745) (← links)
- Classical access structures of ramp secret sharing based on quantum stabilizer codes (Q2677549) (← links)
- Correction to: ``Entanglement-assisted quantum error-correcting codes over arbitrary finite fields'' (Q2690503) (← links)
- Secure Multiplex Coding With Dependent and Non-Uniform Multiple Messages (Q2976829) (← links)
- Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding (Q2977380) (← links)
- Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes (Q2986079) (← links)
- Secure key rate of the BB84 protocol using finite sample bits (Q3066045) (← links)
- A New Method for Constructing Small-Bias Spaces from Hermitian Codes (Q3166962) (← links)
- NOISE TOLERANCE OF THE BB84 PROTOCOL WITH RANDOM PRIVACY AMPLIFICATION (Q3427049) (← links)
- On Field Size and Success Probability in Network Coding (Q3519560) (← links)
- Almost Security of Cryptographic Boolean Functions (Q3547198) (← links)
- Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography (Q3548016) (← links)
- Narrow basis angle doubles secret key in the BB84 protocol (Q3558443) (← links)
- Radical Computation for Small Characteristics (Q3652842) (← links)
- Conversion of a general quantum stabilizer code to an entanglement distillation protocol (Q4468275) (← links)
- (Q4502635) (← links)
- Relative Generalized Matrix Weights of Matrix Codes for Universal Security on Wire-Tap Networks (Q4569202) (← links)
- Geometric and Computational Approach to Classical and Quantum Secret Sharing (Q4610014) (← links)
- Improvement of Ashikhmin-Litsyn-Tsfasman bound for quantum codes (Q4677532) (← links)
- Universal Secure Multiplex Network Coding With Dependent and Non-Uniform Messages (Q4682977) (← links)
- Lower bound for the quantum capacity of a discrete memoryless quantum channel (Q4832732) (← links)
- On computing the integral closure (Q4942367) (← links)
- Improvement of stabilizer-based entanglement distillation protocols by encoding operators (Q5290728) (← links)
- Generalized Sudan’s List Decoding for Order Domain Codes (Q5386077) (← links)
- Computing the radical of an ideal in positive characteristic (Q5945292) (← links)
- Steane enlargement of entanglement-assisted quantum error-correcting codes (Q6095392) (← links)
- New Parameters of Linear Codes Expressing Security Performance of Universal Secure Network Coding (Q6234242) (← links)
- Coding Theoretic Construction of Quantum Ramp Secret Sharing (Q6251185) (← links)
