Tokyo City University

Researchers Information System

inspection-site

Japanese English

TOP
Search by Faculty
or Department
Search by Keyword
Search by Research
Field
Detailed Search

Tokyo City University top

NIINOMI Toshihiro

Profile Research field Research achievement Educational achievement Social contribution achievement

 

Published Papers  
No.TitleJournalVolNoStart PageEnd PagePublication dateDOIReferee
1Upper Bounds on the Error Probability for the Ensemble of Linear Block Codes with Mismatched Decoding_ IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 105 363 371 2022 https://doi.org/10.1587/transfun.2021TAP00011Refereed 
2Performance of Non-Binary LDPC Codes on Two-Dimensional Array Erasure Models Proceedings of 2020 International Symposium on Information Theory and its Applications, ISITA 2020 220 224 Oct. 24, 2020  Refereed 
3Decision Feedback Scheme with Criterion LR+Th for the Ensemble of Linear Block Codes. IEICE Transactions 103-A 334 345 2020 https://doi.org/10.1587/transfun.2019EAP10451Refereed 
4On the DS2 Bound for Forney’s Generalized Decoding Using Non-Binary Linear Block Codes IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (Web) E101.A 1223‐1234(J‐STAGE) 1234 Aug. 2018 https://doi.org/10.1587/transfun.E101.A.12231Refereed 
5Decision Feedback Scheme with Criterion LR+Th for the Ensemble of Linear Block Codes. International Symposium on Information Theory and Its Applications(ISITA) 261 265 2018 https://doi.org/10.23919/ISITA.2018.86643361Refereed 
62‐レベル不均一誤り訂正符号の線形計画限界 電子情報通信学会論文誌 A(Web) J100-A 316‐324 (WEB ONLY) Sep. 1, 2017  Refereed 
7A Note on Unequal Elinor Protection in Random Network Coding PROCEEDINGS OF 2016 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2016) 661 665 2016  Refereed 
8Forneyの最尤復号法の一般化におけるShulman‐Feder上界式の精密化 電子情報通信学会論文誌 A(Web) J98-A 12 680-690 (WEB ONLY) Dec. 1, 2015  Refereed 
9Design Method for a Interface Considering Circuit Performance in GALS Systems Based on Clock Gating The IEICE transactions on information and systems 94 324 333 Jan. 1, 2011  Refereed 
10A Modification of Battail-SOVA The IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (Japanese edition) A 93 10 667 676 Oct. 1, 2010  Refereed 
11On error exponents for a variable size list decoder using the Viterbi algorithm with likelihood testing ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE 90 27 36 2007 https://doi.org/10.1002/ecjc.202451Not refereed 
12On Improvement of Error Exponents for Decision Feedback Scheme with LR+Th The IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (Japanese edition) A 89 12 1168 1174 Dec. 1, 2006  Refereed 
13On Error Exponents for Variable Size List Decoder Using the Viterbi Algorithm with Likelihood Ratio Testing The IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (Japanese edition) A 88 11 1343 1351 Nov. 2005  Refereed 
14A New Decoding Algorithm Using Likelihood Ratio Testing for Tree Codes The Transactions of the Institute of Electronics, Information and Communication Engineers A 87 224 233 Feb. 1, 2004  Refereed 
15On the generalized viterbi algorithm using likelihood ratio testing ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS 366 366 2002 https://doi.org/10.1109/ISIT.2002.10236381Refereed 
16A Decision Feedback Scheme Using List Decoding for Tree Codes The Transactions of the Institute of Electronics,Information and Communication Engineers. A vol.J83-A No.1,pp.67-82 67 82 Jan. 25, 2000  Refereed 
17On Analysis of noiseless decision feedback scheme using fixed size list decoder for tree codes 2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS 231 231 2000 https://doi.org/10.1109/ISIT.2000.8665291Refereed 
18On block coded ARQ schemes cumulating the rejected sequences IEEE International Symposium on Information Theory - Proceedings 376 1994 https://doi.org/10.1109/ISIT.1994.3946431Refereed 

 

MISC  
No.TitleJournalVolNoStart PageEnd PagePublication date
1On reducing comlexity of BP-List-Erasure Decoding 電子情報通信学会大会講演論文集(CD-ROM) 2021 2021 
2Non-Uniform Window Decoding Schedules and the Condition of its Update 電子情報通信学会大会講演論文集(CD-ROM) 2021 2021 
3外部値と一時推定語の符号比較を用いたBP復号法のダイナミックスケジューリング 電子情報通信学会大会講演論文集(CD-ROM) 2018 ROMBUNNO.A‐2‐3 Mar. 6, 2018 
4外部値と一時推定語の符号比較を用いたBP復号法のスケジューリング 電子情報通信学会大会講演論文集(CD-ROM) 2017 ROMBUNNO.A‐2‐7 Aug. 29, 2017 
5LDPC符号を用いたRB‐HARQ方式における計算量削減 電子情報通信学会大会講演論文集(CD-ROM) 2017 ROMBUNNO.A‐2‐5 Mar. 7, 2017 
6On Efficient Feedback Scheme for Reliability-Based Hybrid ARQ Using LDPC Codes Proceedings of the IEICE Engineering Sciences Society/NOLTA Society Conference 2016 42 42 Mar. 1, 2016 
7A Note on Unequal Error Protection in Random Network Coding 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 115 394 Jan. 18, 2016 
8q元線形符号を用いたForneyの最尤復号法の一般化に対するShulman‐Feder上界式 情報理論とその応用シンポジウム予稿集(CD-ROM) 38th ROMBUNNO.9.1.3 Nov. 17, 2015 
9On relations between DS2 bound and Sulman-Feder bound for Forney's Generalized Decoding IEICE technical report. Information theory 114 224 13 18 Sep. 19, 2014 
10A-6-12 On ARQ scheme using Linear Programming decoding with Branch-and-Cut Approach Proceedings of the IEICE General Conference 2013 134 134 Mar. 5, 2013 
11シリアルスケジューリングを用いたMin‐Sum復号法の計算量削減について 情報理論とその応用シンポジウム予稿集(CD-ROM) 33rd ROMBUNNO.6.1 Nov. 23, 2010 
12BPの事後値の分散を監視するRB‐HARQ方式 情報理論とその応用シンポジウム予稿集(CD-ROM) 33rd ROMBUNNO.41.3 Nov. 23, 2010 
13排他的な処理を含むSTGに対するCSC Conflictの因果関係追加による解消手法について 情報処理学会全国大会講演論文集 72nd 1.237-1.238 238 Mar. 8, 2010 
14束データ方式のデータパス回路に適した非同期式制御回路の一設計手法 情報処理学会全国大会講演論文集 72nd 1.235-1.236 236 Mar. 8, 2010 
15一方向の計算に制約をおくMax‐Log‐Mapアルゴリズムの精密化について 情報理論とその応用シンポジウム予稿集(CD-ROM) 32nd ROMBUNNO.W42-1 Nov. 24, 2009 
16GALS型システムにおける効率的なインタフェースの一構成法 情報処理学会全国大会講演論文集 71st 1.183-1.184 184 Mar. 10, 2009 
17非同期式制御回路設計におけるSTGのCSC conflict解消のための効率的な因果関係追加に関する一考察 情報処理学会全国大会講演論文集 71st 1.53-1.54 54 Mar. 10, 2009 
18Viterbiアルゴリズムを用いたリスト復号法に対するメモリトランケーションについて 情報理論とその応用シンポジウム予稿集(CD-ROM) 31st ROMBUNNO.8.4.1 Sep. 30, 2008 
19Viterbiアルゴリズムにおける尤度比検定を用いたリスト復号が保持すべきサバイバの本数について 情報理論とその応用シンポジウム予稿集(CD-ROM) 30th ROMBUNNO.44.3 Nov. 20, 2007 
20On Error Exponents for Variable Size List decoder using the Viterbi Algorithm with Likelihood Ratio Testing 情報理論とその応用シンポジウム予稿集 = The proceedings of the Symposium on Information Theory and Its Applications 27 815 818 Dec. 14, 2005 
21リスト復号に対する判定帰還方式LR+THの誤り指数について 情報理論とその応用シンポジウム予稿集 25th Vol.2 627 630 Dec. 10, 2002 
22On fixed delay decoding for ARQ scheme using the Viterbi algorithm Dec. 1996 
23On coded ARQ schemes cumulating the rejected sequences for very noisy channel. 電子情報通信学会技術研究報告 96 53(IT96 1-9) 12 May. 22, 1996 
24On coded ARQ schemes cumulating the rejected sequences for very noisy channel IEICE technical report. Information theory 96 53 12 May. 22, 1996 
25A Note on the Construction Method of Decision Trees. 電子情報通信学会技術研究報告 94 171(IT94 36-54) 49 54 Jul. 23, 1994 
26On coded ARQ schemes cumulating the rejected sequences. 電子情報通信学会技術研究報告 94 35(IT94 9-21) 37 42 May. 17, 1994 
27A Note On Construction of Information Networks Considering Reliability. 電子情報通信学会技術研究報告 93 164(IT93 28-46) 25 30 Jul. 24, 1993 
28On block coded ARQ schemes cumulating the rejected information. 電子情報通信学会技術研究報告 93 164(IT93 28-46) 101 106 Jul. 24, 1993 
29A note on construction of information networks considering reliability IEICE technical report. Information theory 93 164 25 30 Jul. 24, 1993 
30On block coded ARQ schemes cumulating the rejected information IEICE technical report. Information theory 93 164 101 106 Jul. 24, 1993 
31On Reasoning with Reliability of Estimation. 日本経営工学会春季大会予稿集 1993 74 75 May. 1993 
32A Note on Sequential Decoding of Convolutional Codes through a Burst Error Channel. 電子情報通信学会技術研究報告 92 133(IT92 19-34) 29 32 Jul. 11, 1992 
33A Note on Statistical Decision Rule. Inductive Inference from Facts with Noise. 電子情報通信学会技術研究報告 92 133(IT92 19-34) 45 48 Jul. 11, 1992 
34A Note on Learning Algorithms for inductive Inferece. 電子情報通信学会技術研究報告 92 133(IT92 19-34) 49 52 Jul. 11, 1992 
35A Note on the Performance of Sequential Decoding Using the Algbraic Structure of Convolutional Codes. 電子情報通信学会技術研究報告 92 57(IT92 11-18) 29 34 May. 26, 1992 
36Optimality Principle for List‐of‐H Decoding and Its Application for Ohtaining Reliability Information of Survivor Paths. 電子情報通信学会大会講演論文集 1992 Shunki Pt 1 1.330 330 Mar. 1992 
37A Note on Sequential Decoding. 電子情報通信学会技術研究報告 91 162(IT91 40-51) 13 16 Jul. 20, 1991 
38On desision feed‐back scheme using Viterbi algorithm. Bulletin of the Centre for Informatics. Waseda University 13 95 97 Jul. 1991 
39On the viterbi algorithm with decision feed back. Path memory truncation on the viterbi alogorithm with decision feed back. 電子情報通信学会技術研究報告 90 234(IT90 52-59) Sep. 28, 1990 
40A note on ARQ schemes for bidirectional communication systems. 電子情報通信学会技術研究報告 90 152(IT90 33-51) 51 54 Jul. 21, 1990 
41A note on performance of adaptive ARQ schemes. 電子情報通信学会技術研究報告 90 152(IT90 33-51) 47 50 Jul. 21, 1990 
42Path memory truncation on the Viterbi algorithm with decision feed back. 電子情報通信学会技術研究報告 89 432(SP89 124-130) 29 34 Feb. 23, 1990 
43A note on efficient ARQ scheme using concatenated codes. 電子情報通信学会技術研究報告 89 145(IT89 22-33) 31 36 Jul. 21, 1989 
44A note on efficient ARQ scheme. 電子情報通信学会技術研究報告 88 139 33-37(IT88-27) Jul. 23, 1988