| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| IT | 2015-09-04 14:25 |
Ishikawa | Hakusan Shobutei | optimization for the average performance of three-state system with probabilistic transition Takato Kimura, Ken-ichi Iwata (Univ. of Fukui), Hirosuke Yamamoto (The Univ. of Tokyo)  IT2015-42 |
For a three-state system with probabilistic transition, we consider an optimization problem for the average performance ... [more] | IT2015-42 pp.49-54 |
| EMM, IT | 2015-05-21 10:40 |
Kyoto | Kyoto International Community House | Feasible regions of symmetric capacity and Gallager's $E_{0}$ functions for discrete memoryless channels under a uniform input distribution Yuta Sakai, Ken-ichi Iwata (Univ. of Fukui) IT2015-2 EMM2015-2 |
This study aims to clarify the extremal channels in the sense of channel reliability functions for some class of channel... [more] | IT2015-2 EMM2015-2 pp.7-12 |
| ISEC, IT, WBS | 2015-03-02 16:40 |
Fukuoka | The University of Kitakyushu | Algorithms to reduce the number of output symbols on condition that discrete memoryless channel satisfies admissible mutual information Takumi Nagahara, Yuta Sakai, Ken-ichi Iwata (Univ. of Fukui) IT2014-86 ISEC2014-99 WBS2014-78 |
Some quantization techniques are used in channel coding system to reduce the complexity of coding problem. Kurkoski and... [more] |
IT2014-86 ISEC2014-99 WBS2014-78 pp.153-158 |
| IT | 2014-07-18 14:25 |
Hyogo | Kobe University | On Quantization by Greedy Combining for Outputs of Discrete Memoryless Channels Yuta Sakai, Ken-ichi Iwata (Univ. of Fukui) IT2014-34 |
Some quantization techniques are used in practice system to reduce the complexity of coding problem. Kurkoski and Yagi ... [more] |
IT2014-34 pp.127-132 |
| IT | 2014-05-16 13:25 |
Oita | Beppu International Convention Center | A method of parallel processing of syndromes to decode primitive BCH codes Ken-ichi Iwata, Reiya Ooshima (Univ. of Fukui) IT2014-5 |
We consider numbers of addition and multiplication operations to calculate an error syndrome for q-ary primitive BCH cod... [more] | IT2014-5 pp.23-26 |
| ISEC, IT, WBS | 2014-03-10 10:35 |
Aichi | Nagoya Univ., Higashiyama Campus | Maximum Redundancy of Lossless Data Compression via Substring Enumeration with a Finite Alphabet Ken-ichi Iwata (Univ. of Fukui), Mitsuharu Arimura (Shonan Inst. of Tech.) IT2013-55 ISEC2013-84 WBS2013-44 |
(To be available after the conference date) [more] | IT2013-55 ISEC2013-84 WBS2013-44 pp.7-12 |
| IT | 2013-09-27 14:55 |
Okinawa | Culture Resort Festone (Okinawa) | Number of operations of parallel decoder for q-ary Hamming codes Reiya Ooshima, Ken-ichi Iwata (Univ. of Fukui) IT2013-40 |
We consider the number of addition operations of parallel decoder to calculate an error syndrome for $q$-ary $left(frac{... [more] | IT2013-40 pp.49-54 |
| IT | 2013-05-24 15:10 |
Fukui | Hotel Matuya Sensen at Awara-onsen, Fukui Pref. | On the Existence Condition of a VF Code for an Infinite-Alphabet Source Mitsuharu Arimura (Shonan Inst. of Tech.), Ken-ichi Iwata (Fukui Univ.) IT2013-9 |
In this paper, the performance of a variable-to-fixed length code (VF code) for a general source with countably infin... [more] |
IT2013-9 pp.41-46 |
| IT | 2013-05-24 15:35 |
Fukui | Hotel Matuya Sensen at Awara-onsen, Fukui Pref. | Speed-up technique for quantizer design for outputs of binary-input discrete memoryless channels by SMAWK algorithm Ken-ichi Iwata, Shin-ya Ozawa (Univ. of Fukui) IT2013-10 |
Quantizer design algorithm is recently proposed by Kurkoski and Yagi for arbitrary binary-input discrete memoryless chan... [more] | IT2013-10 pp.47-52 |
| IT, ISEC, WBS | 2013-03-07 13:40 |
Osaka | Kwansei Gakuin Univ., Osaka-Umeda Campus | Maximum Redundancy of Lossless Data Compression via Substring Enumeration for Markov Sources Ken-ichi Iwata (Univ. of Fukui), Mitsuharu Arimura (Shonan Inst. Tech.), Yuki Shima (Univ. of Fukui) IT2012-76 ISEC2012-94 WBS2012-62 |
Dub\'{e} and Beaudoin proposed a technique of lossless data compression called compression via substring enumeration (CS... [more] | IT2012-76 ISEC2012-94 WBS2012-62 pp.95-100 |
| IT | 2012-09-28 08:45 |
Gunma | Kusatsu Seminar House | Optimization of Exclusive-OR Operations in Parallel Bit Encoding and Parallel Bit Decoding for Hamming Code Reiya Ooshima, Ken-ichi Iwata (Univ. of Fukui) IT2012-35 |
The paper consider an optimization of the amount of exclusive-or operations in the parallel bit encoding or the parallel... [more] | IT2012-35 pp.25-30 |
| IT, ISEC, WBS | 2012-03-02 16:35 |
Kanagawa | A note on separation conditions of source and channel coding for sources with two-output terminal and channels with two-input and one-output terminals Ken-ichi Iwata, Nobu Mori (Univ. of Fukui) IT2011-83 ISEC2011-110 WBS2011-84 |
This paper considers a separation theorem for a communication system of general sources with two-output terminals and ... [more] |
IT2011-83 ISEC2011-110 WBS2011-84 pp.231-236 |
|
| IT | 2012-01-20 15:20 |
Ibaraki | University of Tsukuba | On Approximate Constructions of Polar Codes for Binary Input Symmetric Channels using Dynamic Programming Yusuke Susuki, Ken-ichi Iwata (Univ. of Fukui) IT2011-42 |
[more] | IT2011-42 pp.19-24 |
| IT | 2011-05-20 11:00 |
Osaka | Osaka City University | An Improvement of Lossless Data Compression via Substring Enumeration Yuki Shima, Ken-ichi Iwata (Univ. of Fukui), Mitsuharu Arimura (Shonan Inst. of Tech.) IT2011-1 |
(To be available after the conference date) [more] | IT2011-1 pp.1-6 |
| ISEC, IT, WBS | 2011-03-03 16:35 |
Osaka | Osaka University | The Width of Information-Spectrum and the Worst-Case Redundancy of Fixed-Length Coding Hiroki Koga (Univ. of Tsukuba), Mitsuharu Arimura (Shonan Inst. of Tech.), Ken-ichi Iwata (Univ. of Fukui) IT2010-83 ISEC2010-87 WBS2010-62 |
[more] | IT2010-83 ISEC2010-87 WBS2010-62 pp.93-98 |
| ISEC, IT, WBS | 2011-03-03 17:00 |
Osaka | Osaka University | A Dynamic Programming of Joint Source-Channel Coding for Discrete Memoryless Sources and (d,k)-constrained Channels using Monge Property Takuya Koyama, Ken-ichi Iwata (Univ of Fukui) IT2010-84 ISEC2010-88 WBS2010-63 |
We consider a problem to build good prefix-free codes for stationary memoryless sources over finite-state noiseless ch... [more] |
IT2010-84 ISEC2010-88 WBS2010-63 pp.99-104 |
| IT | 2011-01-18 13:00 |
Nara | A construction of approximate polar codes with linear time of codeword length Yusuke Susuki, Ken-ichi Iwata (Univ. of Fukui) IT2010-58 |
We consider a construction algorithm of approximate Polar codes for symmetric discrete memoryless channels. We propos... [more] |
IT2010-58 pp.25-30 |
|
| IT | 2010-07-22 16:00 |
Tokyo | Kogakuin University | The Minimum Achievable Redundancy Rate of Fixed-to-Fixed Length Lossless Source Codes for General Sources Mitsuharu Arimura (Shonan Inst. of Tech.), Ken-ichi Iwata (Univ. of Fukui) IT2010-21 |
This paper investigates the minimum achievable redundancy rate of fixed-to-fixed length lossless source codes (FF codes)... [more] | IT2010-21 pp.57-62 |
| IT | 2010-05-21 16:35 |
Tokushima | the University of Tokushima | A generalization of Verdu-Han lemma with a distortion criterion Nobu Mori, Ken-ichi Iwata (Univ. of Fukui) IT2010-10 |
(To be available after the conference date) [more] | IT2010-10 pp.51-56 |
| IE | 2010-03-15 17:00 |
Miyagi | RIEC Bldg. #2, 4gh Floor, Tohoku Univ. | The optimization of reference pixel arrangement in the lossless coding for HDTV image Yuya Yamaguchi, Takashi Otsuki (Yamagata Univ.), Ken-ichi Iwata (Fukui Univ.), Shuichi Itoh (UEC) IE2009-195 |
(To be available after the conference date) [more] | IE2009-195 pp.91-96 |
[Return to Top Page]