Updated on 2023/11/28

写真a

 
KAZAMA, Koki
 
Affiliation
Faculty of Science and Engineering, School of Fundamental Science and Engineering
Job title
Assistant Professor(non-tenure-track)
Degree
Doctor of Engineering ( 2022.02 Waseda University )

Research Experience

  • 2022.04
    -
    Now

    Shonan Institute of Technology

  • 2022.04
    -
    Now

    Yokohama College of Commerce

  • 2022.04
    -
    Now

    Waseda University   Department of Applied Mathematics, School of Fundamental Science and Engineering   Assistant Professor (without tenure)

  • 2015.04
    -
    2016.03

    早稲田中学校   数学科   非常勤講師

Education Background

  • 2016.04
    -
    2022.02

    Waseda University   Graduate School of Fundamental Science and Engineering   Department of Pure and Applied Mathematics  

  • 2014.04
    -
    2016.03

    Waseda University   Graduate School of Fundamental Science and Engineering   Department of Pure and Applied Mathematics  

  • 2010.04
    -
    2013.03

    Waseda University   School of Fundamental Science and Engineering   Department of Applied Mathematics  

Research Areas

  • Statistical science   統計的決定理論 / Information security   秘密分散 / Mathematical informatics   誤り訂正符号

Research Interests

  • machine learning

  • experimental design

  • coding theory

  • Bayesian statistical decision theory

  • error-correcting code

  • Distibuted Computation

  • Network Coding

  • Secret Sharing

▼display all

 

Papers

  • A Coded Computation Method Based on a Gabidulin Code and the Evaluation of its Error-Correcting Capability

    風間皐希, 鎌塚明, 吉田隆弘, 松嶋敏泰

    電子情報通信学会論文誌 A(Web)   J104-A ( 6 ) 156 - 159  2021.06

    　View Summary

    This study discusses a coded computation method for the product of two matrices. This method corrects errors in computing by encoding the product matrix through the whole process. This study proposes a method that encodes the product matrix by a Gabidulin encoding and evaluates its error-correcting capability.

    DOI J-GLOBAL

  • 拡張直交配列を用いた混合水準の実験計画法に関する一考察

    山口純輝, 山口純輝, 風間皐希, 鎌塚明, 齋藤翔太, 松嶋敏泰

    電子情報通信学会論文誌 A(Web)   J103-A ( 1 )  2020

    J-GLOBAL

Presentations

  • A Group-Type Distributed Coded Computation Scheme Based on a Gabidulin Code

    Presentation date： 2023.09

    Event date：
    2023.09
    -
    　

  • Private Information Retrieval と Smooth Locally Decodable Code の関係

    風間皐希

    早稲田大学組合せ論セミナー 

    Presentation date： 2023.04

  • A Note on a Group-type Distributed Coded Computation Scheme Based on a Gabidulin Code and its Erasure Decoding

    Presentation date： 2022.11

    Event date：
    2022.11
    -
    2022.12

  • Markov Chain Monte Carlo Method for Meta-Trees on Decision Tree Model

    Presentation date： 2022.11

    Event date：
    2022.11
    -
    2022.12

  • ベイズ決定理論に基づく機械学習ライブラリ：BayesML 0.2.0

    中原悠太, 齋藤翔太, 島田航志, 飯窪祐二, 風間皐希, 一條尚希, 松嶋敏泰, BayesML Developers

    第25回情報論的学習理論ワークショップ(IBIS2022) 

    Presentation date： 2022.11

    Event date：
    2022.11
    　
    　

  • A Group-Type Distributed Coded Computation Scheme Based on a Gabidulin Code

    Koki Kazama, Toshiyasu Matsushima

    The International Symposium on Information Theory and Its Applications (ISITA) 

    Presentation date： 2022.10

    Event date：
    2022.10
    　
    　

  • A Group-Type Distributed Secure Coded Computation Scheme Based on a Secret Sharing

    Koki Kazama, Toshiyasu Matsushima

    The International Symposium on Information Theory and Its Applications (ISITA) 

    Presentation date： 2022.10

    Event date：
    2022.10
    　
    　

  • An Algorithm for Computing the Stratonovich's Value of Information

    Akira Kamatsuka, Takahiro Yoshida, Koki Kazama, Toshiyasu Matsushima

    The International Symposium on Information Theory and Its Applications (ISITA) 

    Presentation date： 2022.10

    Event date：
    2022.10
    　
    　

  • ベイズ決定理論に基づく機械学習ライブラリ：BayesML 0.1.0

    中原 悠太, 一條 尚希, 島田 航志, 飯窪 祐二, 齋藤 翔太, 風間 皐希, 松嶋 敏泰, BayesML Code Authors

    2022年度統計関連学会連合大会 

    Presentation date： 2022.09

    Event date：
    2022.09
    　
    　

  • 開始終了間隔の回帰モデル化に基づく開始時点が異なる複数対象の単位期間内終了件数の予測

    香山 渉, 中原 悠太, 風間 皐希, 島田 航志, 小坂 奏平, 藤田 剛, 松嶋 敏泰

    2022年度統計関連学会連合大会 

    Presentation date： 2022.09

    Event date：
    2022.09
    　
    　

  • An Approximation by Meta-Tree Boosting Method to Bayesian Optimal Prediction for Decision Tree Model

    于 文斌, 風間皐希, 中原悠太, 一條尚希, 齋藤翔太, 松嶋敏泰

    Presentation date： 2022.01

    Event date：
    2022.01
    　
    　

  • A Note on Secure Distributed Matrix Multiplication Methods Based on Secret Sharing Systems with General Access Structures

    風間 皐希, 松嶋 敏泰

    Presentation date： 2021.12

    Event date：
    2021.12
    　
    　

  • 高効率なプライバシー保護情報検索システムの構成アルゴリズムの提案

    今津潮, 風間皐希, 松嶋敏泰

    日本経営工学会2021年春季大会 

    Presentation date： 2021.05

    Event date：
    2021.05
    　
    　

  • Markov Decision Processes for Simultaneous Control of Multiple Objects with Different State Transition Probabilities in Each Cluster

    本村 勇人, 鎌塚 明, 風間 皐希, 松嶋 敏泰

    Presentation date： 2021.03

    Event date：
    2021.03
    　
    　

  • A Note on a Relationship between Smooth Locally Decodable Codes and Private Information Retrieval

    Koki Kazama, Akira Kamatsuka, Takahiro Yoshida, Toshiyasu Matsushima

    The International Symposium on Information Theory and Its Applications (ISITA)  The Institute of Electronics, Information and Communication Engineers

    Presentation date： 2020.10

    Event date：
    2020.10
    　
    　

    　View Summary

    We focus on smooth locally decodable codes (SLDC) and Private Information Retrieval (PIR). Recently, a relationship between SLDC and PIR are studied using information theoretical notations. In this paper, we clarify a relationship between SLDCs and PIR using set theoretical notations mainly.

  • A Note on the Relationship between Smooth Locally Decodable Codes and Private Information Retrieval

    風間 皐希, 鎌塚 明, 吉田 隆弘, 松嶋 敏泰

    電子情報通信学会

    Presentation date： 2020.03

    Event date：
    2020.03
    　
    　

  • セキュアな再生成符号に基づく分散ストレージシステムにおける秘匿情報検索

    鎌塚 明, 風間 皐希, 吉田 隆弘, 松嶋 敏泰

    第42回情報理論とその応用シンポジウム(SITA2019) 

    Presentation date： 2019.11

    Event date：
    2019.11
    　
    　

  • 拡張直交配列を用いた混合水準の実験計画法に関する一考察

    山口 純輝, 風間 皐希, 鎌塚 明, 齋藤 翔太, 松嶋 敏泰

    みずほ銀行・早稲田大学学術交流協定締結1周年記念シンポジウム 

    Presentation date： 2019.07

    Event date：
    2019.07
    　
    　

  • (n,k,d,r,t,x,y)qLRC符号の最小距離および次元の限界式に関する一考察

    風間 皐希, 鎌塚 明, 松嶋 敏泰

    第41回情報理論とその応用シンポジウム 

    Presentation date： 2018.12

    Event date：
    2018.12
    　
    　

  • 拡張直交配列を利用した多水準の実験計画法に関する一考察

    山口 純輝, 風間 皐希, 鎌塚 明, 齋藤 翔太, 松嶋 敏泰

    第41情報理論とその応用シンポジウム 

    Presentation date： 2018.12

    Event date：
    2018.12
    　
    　

  • A Note on a Bound on the Rate of a Locally Recoverable Code with Multiple Recovering Sets

    Koki Kazama, Akira Kamatsuka, Takahiro Yoshida, Toshiyasu Matsushima

    The International Symposium on Information Theory and Its Applications (ISITA)  The Institute of Electronics, Information and Communication Engineers

    Presentation date： 2018.10

    Event date：
    2018.10
    　
    　

    　View Summary

    A locally recoverable code (LRC code) is a code such that each codeword symbol can be recovered from other codeword symbols. In this research, we propose one possible generalization of previous LRC codes and we derive a bound on the rate of the proposed code.

  • ``On Distance Properties of (r; t; x)-LRC Codes''

    風間皐希, 松嶋敏泰

    第7回誤り訂正符号のワークショップISIT論文紹介セッション 

    Presentation date： 2018.09

    Event date：
    2018.09
    　
    　

  • ランク誤りを考慮したcoded computation に関する一考察

    風間皐希, 鎌塚明, 松嶋敏泰

    早稲田大学データ科学総合研究教育センター第3回シンポジウム 

    Presentation date： 2018.07

    Event date：
    2018.07
    　
    　

  • ランク誤りを考慮したcoded computationに関する一考察

    風間 皐希, 鎌塚 明, 松嶋 敏泰

    第40回情報理論とその応用シンポジウム(SITA2017) 

    Presentation date： 2017.11

    Event date：
    2017.11
    -
    2017.12

  • シンボルペア通信路における符号のリスト復号に関する一考察

    風間 皐希, 鎌塚 明, 松嶋 敏泰

    第39回情報理論とその応用シンポジウム予稿集(SITA2016) 

    Presentation date： 2016.12

    Event date：
    2016.12
    　
    　

  • A Note on Unequal Elinor Protection in Random Network Coding

    Tomohiko Saito, Koki Kazama, Toshihiro Niinomi, Toshiyasu Matsushima

    The International Symposium on Information Theory and Its Applications (ISITA)  IEEE

    Presentation date： 2016.11

    Event date：
    2016.10
    -
    2016.11

    　View Summary

    Linear Unequal Error Protection (UEP) codes were proposed by Masnick et al. and largely developed by Dunning et al. and Gils. On the other hand, random linear network coding is recently studied by many researchers. Kotter et al. proposed a new coding technique named subspace codes and applied it to random linear network coding. Moreover. Silva et al. proposed constructions of subspace codes using rank metric codes. In this paper, we propose subspace UEP codes and apply them to the random linear network coding. Then, we propose rank metric UEP codes and constructions of the subspace UEP codes using the rank metric UEP codes.

  • A Maximum Likelihood Decoding Algorithm of Gabidulin Codes in Deterministic Network Coding

    Koki Kazama, Akira Kamatsuka, Toshiyasu Matsushima

    The International Symposium on Information Theory and Its Applications (ISITA)  IEEE

    Presentation date： 2016.11

    Event date：
    2016.10
    -
    2016.11

    　View Summary

    Recently, studies of linear network coding have attracted attention. This paper considers a probabilistic error model for the deterministic linear network coding. In the previous studies of error-correcting codes, Kaneko et al. proposed a decoding algorithms for probabilistic error model. This is a maximum likelihood decoding algorithm that uses the optimization method called branch and bound method. This paper constructs a new model of deterministic linear network coding and proposes a maximum likelihood decoding algorithm that uses the branch and bound method.

  • Subspace Unequal Error Protection Codes for Random Linear Network Coding

    Tomohiko Saito, Koki Kazama, Toshihiro Niinomi, Toshiyasu Matsushima

    2016 International Symposium on Multimedia and Communication technology 

    Presentation date： 2016.08

    Event date：
    2016.08
    　
    　

  • A Note on Unequal Error Protection in Random Network Coding

    斉藤友彦, 風間皐希, 新家稔央, 松嶋敏泰

    電子情報通信学会技術研究報告  電子情報通信学会

    Presentation date： 2016.01

    Event date：
    2016.01
    　
    　

  • A Study on Soft Decision Decoding for Array-Error Channel

    風間皐希, 鎌塚明, 松嶋敏泰

    電子情報通信学会技術研究報告  電子情報通信学会

    Presentation date： 2016.01

    Event date：
    2016.01
    　
    　

▼display all

Misc

  • New Algorithms for Computing Arimoto-Sibson Capacity

    Yuki Ishikawa, Akira Kamatsuka, Koki Kazama

      123 ( 149 ) 44 - 49  2023.08

    Authorship：Last author

    Research paper, summary (national, other academic conference)  

  • A Note on Private Coded Computation Method with Tolerance against Erasure of Responses from Server Groups

    Yusuke Morishita, Atsushi Miki, Koki Kazama, Toshiyasu Matsushima

      123 ( 149 ) 74 - 79  2023.08

    Research paper, summary (national, other academic conference)  

  • Hölder's Reverse Inequality and Its Application to Computation of Lapidoth--Pfister Mutual Information

    Akira Kamatsuka, Koki Kazama

      123 ( 149 ) 50 - 55  2023.08

    Authorship：Last author

    Research paper, summary (national, other academic conference)  

  • A Note on a New Method for Reducing Computation Time in Private Coded Computation

    Atsushi Miki, Shenzhe Gao, Koki Kazama, Toshiyasu Matsushima

      123 ( 14 ) 12 - 17  2023.05

    Research paper, summary (national, other academic conference)  

  • Gabidulin 符号とその Erasure 復号に基づくグループ型符号化分散計算方式に関する一考察

    風間 皐希, 松嶋 敏泰

    第45回情報理論とその応用シンポジウム(SITA2022)     217 - 222  2022.12

    Authorship：Lead author

  • 決定木モデルにおけるメタツリーに対するマルコフ連鎖モンテカルロ法

    中原 悠太, 齋藤 翔太, 一條 尚希, 風間 皐希, 松嶋 敏泰

    第45回情報理論とその応用シンポジウム     47 - 52  2022.12

  • A Group-Type Distributed Coded Computation Scheme Based on a Gabidulin Code

    Koki Kazama, Toshiyasu Matsushima

    2022 The International Symposium on Information Theory and Its Applications (ISITA2022)     183 - 187  2022.12  [Refereed]

    Authorship：Lead author

  • A Group-Type Distributed Secure Coded Computation Scheme Based on a Secret Sharing

    Koki Kazama, Toshiyasu Matsushima

    2022 The International Symposium on Information Theory and Its Applications (ISITA2022)     163 - 167  2022.10  [Refereed]

    Authorship：Lead author

  • An Algorithm for Computing the Stratonovich's Value of Information

    Akira Kamatsuka, Takahiro Yoshida, Koki Kazama, Toshiyasu Matsushima

    2022 The International Symposium on Information Theory and Its Applications (ISITA2022)    2022.10  [Refereed]

  • An Algorithm for Computing the Stratonovich's Value of Information

    Akira Kamatsuka, Takahiro Yoshida, Koki Kazama, Toshiyasu Matsushima

       2022.05

    　View Summary

    We propose an algorithm for computing Stratonovich's value of information
    (VoI) that can be regarded as an analogue of the distortion-rate function. We
    construct an alternating optimization algorithm for VoI under a general
    information leakage constraint and derive a convergence condition. Furthermore,
    we discuss algorithms for computing VoI under specific information leakage
    constraints, such as Shannon's mutual information (MI), $f$-leakage, Arimoto's
    MI, Sibson's MI, and Csiszar's MI.

  • An Approximation by Meta-Tree Boosting Method to Bayesian Optimal Prediction for Decision Tree Model

    Wenbin Yu, Koki KAZAMA, Yuta NAKAHARA, Naoki ICHIJO, Shota SAITO, Toshiyasu MATSUSHIMA

    電子情報通信学会技術研究報告(Web)   121 ( 327(IT2021 28-82) )  2022

    J-GLOBAL

  • Markov Decision Processes for Simultaneous Control of Multiple Objects with Different State Transition Probabilities in Each Cluster

    本村勇人, 鎌塚明, 風間皐希, 松嶋敏泰

    電子情報通信学会技術研究報告(Web)   120 ( 395(IBISML2020 34-61) )  2021

    J-GLOBAL

  • A Note on Secure Distributed Matrix Multiplication Methods Based on Secret Sharing Systems with General Access Structures

    風間皐希, 松嶋敏泰

    情報理論とその応用シンポジウム予稿集(CD-ROM)   44th  2021

    J-GLOBAL

  • 高効率なプライバシー保護情報検索システムの構成アルゴリズムの提案

    今津潮, 風間皐希, 松嶋敏泰

    日本経営工学会春季大会予稿集(Web)   2021  2021

    J-GLOBAL

  • A Note on a Relationship between Smooth Locally Decodable Codes and Private Information Retrieval

    Koki Kazama, Akira Kamatsuka, Takahiro Yoshida, Toshiyasu Matsushima

    IEICE Proceeding Series   65   259 - 263  2020.10

    　View Summary

    We focus on smooth locally decodable codes (SLDC) and Private Information Retrieval (PIR). Recently, a relationship between SLDC and PIR are studied using information theoretical notations. In this paper, we clarify a relationship between SLDCs and PIR using set theoretical notations mainly.

    DOI CiNii

  • A Note on the Relationship between Smooth Locally Decodable Codes and Private Information Retrieval

    風間皐希, 鎌塚明, 吉田隆弘, 松嶋敏泰

    電子情報通信学会技術研究報告   119 ( 473(IT2019 90-120) ) 201 - 206  2020.03

    CiNii J-GLOBAL

  • セキュアな再生成符号に基づく分散ストレージシステムにおける秘匿情報検索

    鎌塚明, 風間皐希, 吉田隆弘, 松嶋敏泰

    情報理論とその応用シンポジウム予稿集(CD-ROM)   42nd  2019

    J-GLOBAL

  • A Note on a Bound on the Rate of a Locally Recoverable Code with Multiple Recovering Sets

    Koki Kazama, Akira Kamatsuka, Takahiro Yoshida, Toshiyasu Matsushima

    IEICE Proceeding Series   55   520 - 520  2018.10

    　View Summary

    A locally recoverable code (LRC code) is a code such that each codeword symbol can be recovered from other codeword symbols. In this research, we propose one possible generalization of previous LRC codes and we derive a bound on the rate of the proposed code.

    DOI CiNii

  • 拡張直交配列を利用した多水準の実験計画法に関する一考察

    山口純輝, 風間皐希, 鎌塚明, 齋藤翔太, 松嶋敏泰

    情報理論とその応用シンポジウム予稿集(CD-ROM)   41st  2018

    J-GLOBAL

  • (n,k,d,r,t,x,y)qLRC符号の最小距離および次元の限界式に関する一考察

    風間皐希, 鎌塚明, 松嶋敏泰

    情報理論とその応用シンポジウム予稿集(CD-ROM)   41st  2018

    J-GLOBAL

  • ランク誤りを考慮したcoded computationに関する一考察

    風間皐希, 鎌塚明, 松嶋敏泰

    情報理論とその応用シンポジウム予稿集(CD-ROM)   40th  2017

    J-GLOBAL

  • Subspace Unequal Error Protection Codes for Random Linear Network Coding

    Tomohiko Saito, Koki Kazama, Toshihiro Niinomi, Toshiyasu Matsushima

    2016 International Symposium on Multimedia and Communication technology     121 - 124  2016.08  [Refereed]

  • A Study on Soft Decision Decoding for Array-Error Channel

    風間皐希, 鎌塚明, 松嶋敏泰

    電子情報通信学会技術研究報告   115 ( 394(IT2015 48-100) ) 7 - 12  2016.01

    CiNii J-GLOBAL

  • A Note on Unequal Error Protection in Random Network Coding

    斉藤友彦, 風間皐希, 新家稔央, 松嶋敏泰

    電子情報通信学会技術研究報告   115 ( 394(IT2015 48-100) ) 1 - 6  2016.01

    CiNii J-GLOBAL

  • シンボルペア通信路における符号のリスト復号に関する一考察

    風間皐希, 鎌塚明, 松嶋敏泰

    情報理論とその応用シンポジウム予稿集(CD-ROM)   39th  2016

    J-GLOBAL

  • A Maximum Likelihood Decoding Algorithm of Gabidulin Codes in Deterministic Network Coding

    Koki Kazama, Akira Kamatsuka, Toshiyasu Matsushima

    PROCEEDINGS OF 2016 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2016)     666 - 670  2016

    　View Summary

    Recently, studies of linear network coding have attracted attention. This paper considers a probabilistic error model for the deterministic linear network coding. In the previous studies of error-correcting codes, Kaneko et al. proposed a decoding algorithms for probabilistic error model. This is a maximum likelihood decoding algorithm that uses the optimization method called branch and bound method. This paper constructs a new model of deterministic linear network coding and proposes a maximum likelihood decoding algorithm that uses the branch and bound method.

  • A Note on Unequal Elinor Protection in Random Network Coding

    Tomohiko Saito, Koki Kazama, Toshihiro Niinomi, Toshiyasu Matsushima

    PROCEEDINGS OF 2016 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2016)     661 - 665  2016

    　View Summary

    Linear Unequal Error Protection (UEP) codes were proposed by Masnick et al. and largely developed by Dunning et al. and Gils. On the other hand, random linear network coding is recently studied by many researchers. Kotter et al. proposed a new coding technique named subspace codes and applied it to random linear network coding. Moreover. Silva et al. proposed constructions of subspace codes using rank metric codes. In this paper, we propose subspace UEP codes and apply them to the random linear network coding. Then, we propose rank metric UEP codes and constructions of the subspace UEP codes using the rank metric UEP codes.

▼display all

 

Syllabus

Teaching Experience

  • ｺﾝﾋﾟｭｰﾀ活用2/旧 ｺﾝﾋﾟｭｰﾀ活用演習II

    Yokohama College of Commerce  

    2022.10
    -
    Now
     

  • ｺﾝﾋﾟｭｰﾀ活用1/旧 ｺﾝﾋﾟｭｰﾀ活用演習I

    Yokohama College of Commerce  

    2022.04
    -
    Now
     

  • Information Theory

    Shonan Institute of Technology  

    2022.04
    -
    Now
     

  • Fundamental Mathematics Keiei

    2022.04
    -
    Now
     

  • Fundamental Mathematics Keiei

    Waseda University  

    2022.04
    -
    Now
     

  • Mathematics A2 Kikan(4)

    Waseda University  

    2022.04
    -
    Now
     

  • Exercises in Modern Mathematics

    Waseda University  

    2022.10
    -
    2023.01
     

  • 代数

    早稲田中学校  

    2015.04
    -
    2016.03
     

▼display all

 

Internal Special Research Projects

  • 効率性，信頼性，情報秘匿性を考慮した機械学習的データ処理方式の理論基盤構築

    2022  

    　View Summary

    本研究ではユーザの情報秘匿性及びデータ処理の効率性と信頼性を考慮した機械学習に用いる計算を行う分散符号化計算システムを研究する．その結果，当初の目的とは若干異なるが，次の成果が得られた．以下の成果は，どちらも，2022年10月の国際会議にて公開された．(1)有限体F_q上の巨大な行列A,Bの積行列ABの計算において，誤り，消失訂正と計算時間を考慮した分散方式に関する提案．(2)誤り，消失訂正と計算時間を考慮した分散符号化計算方式に加え，行列Aの値をワーカーには秘匿する機能も有する新たな方式を提案．