論文

• Tomoharu Shibuya, Kohichi Sakaniwa. Cyclic Codes Suitable for an Iterative Decoding Based on the Sum-Product Algorithm, Proc. of the International Conference on Fundamentals of Electronics, Communications and Computer Sciences , pp. S7-1 - S7-7, 2002.
• Masatoshi Onikubo, Tomoharu Shibuya, Kohichi Sakaniwa. On lower bounds for the minimum distance of LDPC codes constructed by combinatorial design, Technical Report of IEICE, Vol. IT2002, pp. 13-18, 2002.
• Tomoharu Shibuya, Masatoshi Onikubo, Kohichi Sakaniwa. On tightness of Tanner's lower bound for the minimum distance of regular LDPC codes, Proc. of ISITA2002, pp. 283-286, 2002.
• Tomoharu Shibuya, Kohichi Sakaniwa. Factor Graphs for Cyclic Codes with No Cycles of Length Four, Proc. of 24th SITA, Vol. 1, pp. 3-6, 2001.
• Takayuki Nozaki, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa. Detailed Evolution of Degree Distributions in Residual Graphs with Joint Degree Distributions, IEICE Transactions on Fundamentals, IEICE, vol. E91-A, no. 10, pp. 2737--2744, Oct. 2008.
• Takayuki Itsui, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa. Average Bit Erasure Probability of Regular LDPC Code Ensembles under MAP Decoding over BEC, IEICE Transactions on Fundamentals, IEICE, vol. E90-A, no. 9, pp. 1763--1771, Sept. 2007.
• Ryoji Ikegaya, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa. Performance of Standard Irregular LDPC Codes under Maximum Likelihood Decoding, IEICE Transactions on Fundamentals, IEICE, vol. E90-A, no. 7, pp. 1432--1443, July 2007.
• Shin'ya Miyamoto, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa. Sufficient Conditions for a Regular LDPC Code Better than an Irregular LDPC Code, IEICE Transactions on Fundamentals, IEICE, vol. E90-A, no. 2, pp. 531--534, Feb. 2007.
• Ryoji Ikegaya, Kenta Kasai, Yuji Shimoyama, Tomoharu Shibuya, Kohichi Sakaniwa. Weight and Stopping Set Distributions of Two-Edge Type LDPC Code Ensembles, IEICE Transactions on Fundamentals, vol. E88-A, no. 10, pp. 2745--2761, Oct. 2005.
• Ryoji Ikegaya, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa. Asymptotic Weight and Stopping Set Distributions for Detailedly Represented Irregular LDPC Code Ensembles, IEICE Transactions on Fundamentals, vol. E87-A, no. 10, pp. 2484--2492, Oct. 2004.
• Kenta kasai, Tomoharu Shibuya, Kohichi Sakaniwa. Detailedly Represented Irregular Low-Density Parity-Check Codes, IEICE Transactions on Fundamentals, vol. E86-A, no. 10, pp. 2435--2444, Oct. 2003.
• Tomoharu Shibuya, Kohichi Sakaniwa. A note on a lower bound for generalized Hamming weights, Technical Report of IEICE, Vol. IT2001, pp. 15-22, 2001.
• 大石将邦, 松本隆太郎, 渋谷智治, 坂庭好一. 高次の座を用いた代数幾何符号の構成法について, 信学技報, Vol. IT2001, pp. 7-14, 2001.
• Tomoharu Shibuya, Kohichi Sakaniwa. A note on a lower bound for generalized Hamming weights, IEICE Trans. on Fundamentals, Vol. E84-A, No. 12, pp. 3138-3145, 2001.
• Tomoharu Shibuya, Kohichi Sakaniwa. A dual of well-behaving type designed minimum distance, IEICE Trans. on Fundamentals, Vol. E84-A, No. 2, pp. 647-652, 2001.
• TOMOHARU SHIBUYA. On the generalized Hamming weights of cyclic codes, Proc. of the Fourth Conference on Algebraic Geometry, Number Theory, Coding Theory and Cryptography, pp. 133-144, 2000.
• Tomoharu Shibuya, Kohichi Sakaniwa. A Dual of Well-Behaving Type Designed Minimum Distance, Proc. of ISIT 2000, pp. 169, 2000.
• Tomoharu Shibuya, Kohichi Sakaniwa. On the generalized Hamming weights of cyclic codes, Proc. of 23rd SITA, Vol. 2, pp. 651-654, 2000.
• T. Shibuya, K. Sakaniwa. Generator Matrix Oriented Well-Behaving Bound for the MinimumDistance, Proc. of 22nd SITA, Vol. 2, pp. 653-656, 1999.
• TOMOHARU SHIBUYA. Application of Algebraic Geometry to Coding Theory, Proc. of ISAAC 1999, pp. 209-220, 1999.
• T. Shibuya, R. Hasegawa, K. Sakaniwa. A Lower Bound for Generalized Hamming Weights and Condition for t-th Randk MDS, IEICE Trans. on Fundamentals, Vol. E82-A, No. 6, pp. 1090-1101, 1999.
• T. Shibuya, J. Mizutani, K. Sakaniwa. On the Generalized Hamming Weight of Codes Constructed on Affine Algebraic Sets, IEICE Trans. on Fundamentals, Vol. E81-A, No. 11, pp. 1979-1989, 1998.
• TOMOHARU SHIBUYA. Lower Bound on Generalized Hamming Weights in Terms of a Notion of Well-behaving, Proc. of ISIT'98, pp. 96, 1998.
• TOMOHARU SHIBUYA. The condition on t-th rank MDS for binary Reed-Muller codes, 信学技法, Vol. IT97, pp. 1-6, 1998.
• T. Shibuya, R. Hasegawa, K. Sakaniwa. On Generalized Hamming Weight of Linear Codes and a Sufficient Condition of t-th Rank MDS Codes, Proc. of ISITA'98, pp. 323-326, 1998.
• 越智俊輔, 渋谷智治, 山田功, 坂庭好一. MAPアルゴリズムの並列処理によるTurbo-Codeの高速復号法(共著), 電子情報通信学会信学技報, Vol. IT97, pp. 1-6, 1998.
• T. Shibuya, J. Mizutani, K. Sakaniwa. On the Comparison of Lower Bounds for Generalized Hamming Weights, Proc. of TJCOM '98, pp. 23-28, 1998.
• TOMOHARU SHIBUYA. An Improved Bound for the Dimension of Subfield Subcodes(共著), IEICE Transactions on Fundamentals, Vol. E80-A, No. 5, pp. 876-880, 1997.
• T. Shibuya, J. Mizutani, K. Sakaniwa. On Lower Bound of Generalized Hamming Weights for codes on Cab(共著), Proc. of 20th SITA, Vol. 2, pp. 853-856, 1997.
• T. Shibuya, R. Matsumoto, K, Sakaniwa. Simple Estimation for the Dimension of Subfield Subcodes of AG codes, IEICE Transactions on Fundamentals, Vol. E80-A, No. 11, pp. 2058-2065, 1997.
• 澁谷智治. MAPアルゴリズムの並列処理によるTurbo-Codeの高速復号法, 信学技報, Vol. IT97, pp. 1-6, 1997.
• Tomoharu Shibuya, Jiro Mizutani, Kohichi Sakaniwa. Lower bounds for generalized Hamming weights of linear codes on affine algebraic varieties, 信学技報, Vol. IT96, pp. 61-66, 1997.
• 越智俊輔, 渋谷智治, 坂庭好一. 並列型復号器を用いた反復復号に関する一考察, 第20回情報理論とその応用シンポジウム予稿集, Vol. 2, pp. 849-852, 1997.
• 渋谷智治, 水谷二郎, 坂庭好一. アフィン代数多様体上の線形符号の一般化ハミング重みについて, 電子情報通信学会総合大会講演論文集, Vol. 基礎･境界, pp. A-6-2, 1997.
• 金子明敏, 元古一成, 渋谷智治, 山田功, 坂庭好一. 言語の文構造を用いた誤り制御について, 電子情報通信学会総合大会講演論文集, Vol. 基礎境界, pp. 250, 1996.
• TOMOHARU SHIBUYA. On the Simple Estimation for the Dimension of Subfield Subcodes(共著), Proc. of ISITA'96, Vol. 1, pp. 24-30, 1996.
• Tomoharu Shibuya, Ryutaroh Matsumoto, Kohichi Sakaniwa. An improved lower bound for the dimension of subfield subcodes of AG codes, Proc. of Second Shanghai Conference on Designs, Codes and Finite Geometries, pp. 28-29, 1996.
• TOMOHARU SHIBUYA. On the Dimension of Subfield Subcodes of AG Codes, Proceedings of the 1996 IEICE General Conference, No. 1, pp. 245, 1996.
• Tomoharu Shibuya, Hajime Jinushi, Shinji Miura, Kohichi Sakaniwa. On the Performance of Algebrsic Geometric Codes, IEICE Transactions on Fundamentals of Electronics,Communications and Computers, Vol. E79-A, No. 6, pp. 928-937, 1996.
• TOMOHARU SHIBUYA. On the Dimension of Subfield Subcodes of AG Codes, The Proceedings of the 18th Symposium on Information Theory and Its Applications, No. 1, pp. 247-250, 1995.
• TOMOHARU SHIBUYA. On Designed Distance of Algebraic Geometric Codes(共著), Technical Report of IEICE, Vol. IT93, pp. 37-42, 1994.
• TOMOHARU SHIBUYA. On Designed Distance of Algebraic Geometric Codes(共著), Proceedings of International Symposium on Information Theory & Its Application 1994, No. 1, pp. 47-52, 1994.
• 小林鉄太郎, 渋谷智治, 地主創, 坂庭好一. 拡大一般リード・マラー符号のリー距離について, 第17回情報理論とその応用シンポジウム予稿集, Vol. 2, pp. 643-646, 1994.
• TOMOHARU SHIBUYA. On the Performance of Algebraic Geometric Codes(共著), The Proceedings of The 17th Symposium on Information Theory and Its Applications, No. 2, pp. 647-650, 1994.
• Tomoharu Shibuya, Hajime Junushi, Kohichi Sakaniwa. On minimum Lee distance of generalized Reed-Muller code, Proceeding of IEEE, ISIT '93, pp. 36, 1993.
• Tomoharu Shibuya, Hajime Jinushi, Kohichi Sakaniwa. On minimum Lee distance of generalized Reed-Muller code, Proc. of ISITA'92, pp. 603-607, 1992.
• 渋谷智治, 地主創, 坂庭好一 . 一般リード・マラー符号の最小リー距離について, 信学技報, Vol. IT92, pp. 37-40, 1992.

著書

• 坂庭好一, 澁谷 智治. 代数系と符号理論入門, コロナ社 牛来真也, Apr. 2010.
• 東京工業大学全学情報科目実施委員会編, 澁谷智治. 「コンピュータリテラシ」情報環境の使い方, 昭晃堂, 昭晃堂, 2001.
• 坂庭好一, 鈴木博, 荒木純道, 酒井善則, 渋谷智治. ディジタルコミュニケーション (J.G. Proakis著), 科学技術出版, 科学技術出版, 1999.
• T. Shibuya, J. Mizutani, K. Sakaniwa. On Generalized Hamming Weights of Codes Constructed on Affine Algebraic Sets(共著), Springer Lecture Notes in Computer Science, Springer Lecture Notes in Computer Science, Vol. 1255, pp. 311-320, 1997.

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

• Kenta Kasai, Tomoharu Awano, David Declercq, Charly Poulliat, Tomoharu Shibuya, Kohichi Sakaniwa. Weight Distributions of Non-binary LDPC Codes, Proc. ISITA2008, Dec. 2008.
• Tomoharu Awano, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa. Three-Edge type LDPC Code Ensembles with Exponentially Few Codewords with Linear Small Weight, Proc. ISITA2008, Dec. 2008.
• Ryuhei Mori, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa. Asymptotic Gaps between BP Decoding and Local-MAP Decoding for Low-Density Parity-Check Codes, Proc. 5th International Symposium on Turbo Codes and Related Topics, Sept. 2008.
• Tomoharu Awano, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa. Analysis of Weight Distributions of Two-Edge type LDPC Codes by Hayman Approximation, Proc. 5th International Symposium on Turbo Codes and Related Topics, Sept. 2008.
• Takayuki Nozaki, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa. Detailed Evolution of Degree Distributions in Residual Graphs with Joint Degree Distributions, Proc. IEEE ISIT2008, July 2008.
• Ryuhei Mori, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa. Asymptotic Bit Error Probability of LDPC Codes for the Binary Erasure Channel with Finite Number of Iterations, Proc. IEEE ISIT2008, July 2008.
• Tsuyoshi Nakasendo, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa. Two-Edge type LDPC Code Ensembles with Exponentially Few Codewords with Linear Small Weight, Proc. IEEE ISIT2008, July 2008.
• Shin'ya Miyamoto, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa. Tight Bounds of minimum Distance Distributions of Irregular LDPC Code Ensembles, Proc. of IEEE ISIT 2007, IEEE, pp. 756--760, June 2007.
• Tomoharu Awano, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa. Capacity-Achieving Irregular LDPC-GM Codes with Bounded Graphical Complexity on Noisy Channels, Proc. of 2007 Hawaii and SITA Joint Conference on Information Theory, pp. 6--11, May 2007.
• Kenta Kasai, Yuji Shimoyama, Tomoharu Shibuya, Kohichi Sakaniwa. Asymptotic Average Coset Weight Distribution of Multi-Edge Type LDPC Code Ensembles, Proc. of ISITA 2006, pp. 723--728, Oct. 2006.
• Takayuki Itsui, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa. Support Weight Distribution of Regular LDPC Code Ensembles, Proc. of ISITA 2006, pp. 729--734, Oct. 2006.
• Ryoji Ikegaya, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa. Upper Bounds of Block Error Probability of Standard Irregular LDPC Code Ensemble under Maximum Likelihood Decoding, Proc. of 4th International Symposium on Turbo Codes & Related Topics, Vol. CDROM, Apr. 2006.
• Kenta Kasai, Yuji Shimoyama, Tomoharu Shibuya, Kohichi Sakaniwa. Average Coset Weight Distribution of Multi-Edge type LDPC Code Ensembles, Proc. of 4th International Symposium on Turbo Codes & Related Topics, Apr. 2006.

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

• Takayuki Nozaki, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa. A Note on Analitical Solution of Covariance Evolution for Regular LDPC Codes, Proc LDPC Workshop, Sept. 2008.

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

• Tomoharu Awano, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa. Multi-Edge type LDPC Code Ensembles with Exponentially Few Codewords of Linear Small Weight, Proc. LDPC Workshop, Sept. 2008.

学位論文

• Bounds of Linear Codes and Their Applications to Algebraic Geometry Codes,  Thesis,  Doctor of Engineering,  Tokyo Institute of Technology,  1999/03/31,   

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