Research output per year
Research output per year
- 11 results
Search results
-
2020
Adversarial patch attacks on monocular depth estimation networks
Yamanaka, K., Matsumoto, R., Takahashi, K. & Fujii, T., 28 Sept 2020, In: IEEE Access. 8, p. 179094-179104 11 p.Research output: Contribution to journal › Journal article › Research › peer-review
Open AccessFile15 Citations (Scopus)22 Downloads (Pure) -
Improved Gilbert–Varshamov Bound for Entanglement-Assisted Asymmetric Quantum Error Correction by Symplectic Orthogonality
Yamashita, R., 22 Apr 2020, In: IEEE Transactions on Quantum Engineering. 1, 4 p., 4100604.Research output: Contribution to journal › Journal article › Research › peer-review
Open AccessFile19 Downloads (Pure) -
Message randomization and strong security in quantum stabilizer-based secret sharing for classical secrets
Matsumoto, R., 2020, In: Designs, Codes, and Cryptography. 88, 9, p. 1893-1907 15 p.Research output: Contribution to journal › Journal article › Research › peer-review
Open AccessFile2 Citations (Scopus)24 Downloads (Pure) -
2019
Entanglement-assisted quantum error-correcting codes over arbitrary finite fields
Galindo, C., Hernando, F., Yamashita, R. & Ruano, D., 2019, In: Quantum Information Processing. 18, 4, 116.Research output: Contribution to journal › Journal article › Research › peer-review
Open AccessFile59 Citations (Scopus)142 Downloads (Pure) -
Rate-distortion-perception tradeoff of variable-length source coding for general information sources
Yamashita, R., 2019, In: IEICE Communications Express. 8, 2, p. 38-42 5 p.Research output: Contribution to journal › Journal article › Research › peer-review
Open Access -
Strongly secure quantum ramp secret sharing constructed from algebraic curves over finite fields
Yamashita, R., 2019, In: Advances in Mathematics of Communication. 13, 1, p. 1-10 10 p.Research output: Contribution to journal › Journal article › Research › peer-review
1 Citation (Scopus) -
2018
Relative generalized matrix weights of matrix codes for universal security on wire-tap networks
Martinez Peñas, U. & Matsumoto, R. Y., 2018, In: I E E E Transactions on Information Theory. 64, 4, p. 2529 - 2549 21 p.Research output: Contribution to journal › Journal article › Research › peer-review
Open AccessFile14 Citations (Scopus)248 Downloads (Pure) -
2017
On asymptotically good ramp secret sharing schemes
Geil, H. O., Martin, S., Martinez Peñas, U., Matsumoto, R. Y. & Ruano Benito, D., 2017, In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. E100-A, 12, p. 2699-2708 10 p.Research output: Contribution to journal › Journal article › Research › peer-review
3 Citations (Scopus) -
2015
Quantum strongly secure ramp secret sharing
Zhang, P. & Matsumoto, R. Y., 1 Feb 2015, In: Quantum Information Processing. 14, 2, p. 715-729Research output: Contribution to journal › Journal article › Research › peer-review
13 Citations (Scopus) -
Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding
Kurihara, J., Matsumoto, R. Y. & Uyematsu, T., 1 Jul 2015, In: IEEE Transactions on Information Theory. 61, 7, p. 3912-3936 25 p., 7101826.Research output: Contribution to journal › Journal article › Research › peer-review
43 Citations (Scopus) -
2012
Secret sharing schemes based on linear codes can be precisely characterized by the relative generalized hamming weight
Kurihara, J., Uyematsu, T. & Matsumoto, R., 1 Nov 2012, In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. E95-A, 11, p. 2067-2075 9 p.Research output: Contribution to journal › Journal article › Research › peer-review
34 Citations (Scopus)