論文

• Jun Kurihara, Ryutaroh Matsumoto, Tomohiko Uyematsu. Relative Generalized Rank Weight of Linear codes and Its Applications to network coding, IEEE Transactions On information theory, Vol. 61, No. 7, pp. 3912-3936, July 2015.
• 栗原淳, 松本隆太郎, 植松友彦. 線型符号の相対パラメータによって表される秘密分散法の安全性, IEICE Fundamentals Review, 電子情報通信学会, Vol. 19, No. 1, pp. 14-23, July 2015.
• 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. Fundamentals, 電子情報通信学会, Vol. E95-A, No. 11, pp. 2067-2075, Nov. 2012.
• Jun Kurihara, Tomohiko Uyematsu. A Novel Realization of Threshold Schemes over Binary Field Extensions, IEICE Trans. Fundamentals,, IEICE, vol. E94-A, no. 6, pp. 1375-1380, June 2011.

国際会議発表 (査読有り)

• Jun Kurihara, Tomohiko Uyematsu, Ryutaroh Matsumoto. New Parameters of Linear Codes Expressing Security Performance of Universal Secure Network Coding, 50th Annual Allerton Conference on Communication, Control, and Computing, Proc. of 50th Annual Allerton Conference on Communication, Control, and Computing, Oct. 2012.
• Jun Kurihara, Tomohiko Uyematsu, Ryutaroh Matsumoto. Explicit Construction of Universal Strongly Secure Network Coding via MRD Codes, 2012 IEEE International Symposium on Information Theory, Proc. of 2012 IEEE Int. Symp. on Information Theory, pp. 1488-1492, July 2012.
• Jun Kurihara, Tomohiko Uyematsu. Strongly-secure secret sharing based on linear codes can be characterized by generalized Hamming weight, The 49th Annual Allerton Conference on Communication, Control, and Computing, Proc. of the 49th Annual Allerton Conference on Communication, Control, and Computing, pp. 951-957, Sept. 2011.

国内会議発表 (査読なし・不明)

• Jun Kurihara, Tomohiko Uyematsu, Ryutaroh Matsumoto. Secret Sharing Schemes Based on Linear Codes Can Be Precisely Characterized by the Relative Generalized Hamming Weight, 電子情報通信学会総合大会, 電子情報通信学会 総合大会講演論文集, 社団法人 電子情報通信学会, Mar. 2012.
• Jun Kurihara, Tomohiko Uyematsu. Strongly-Secure Secret Sharing Based on Linear Codes Can Be Characterized by Generalized Hamming Weight, 情報理論研究会, 電子情報通信学会 技術報告, vol. 111, no. 142, pp. 35-40, July 2011.

[ BibTeX 形式で保存 ]    [ 論文・著書をCSV形式で保存 ]    [ 特許をCSV形式で保存 ]