Committee 
Date Time 
Place 
Paper Title / Authors 
Abstract 
Paper # 
WBS, IT, ISEC 
20210305 14:20 
Online 
Online 
Improvement of CicaleseGarganoVaccaro Algorithm for the MinimumEntropy Couplings Problem Kohei Sakatani, Kenichi Iwata (Univ. of Fukui), Hiroshi Fujisaki (Kanazawa Univ.) IT2020151 ISEC202081 WBS202070 
MinimumEntropy coupling is a problem of finding a joint probability distribution of minimum entropy from the set of joi... [more] 
IT2020151 ISEC202081 WBS202070 pp.239244 
SIP, IT, RCS 
20210121 10:55 
Online 
Online 
A counterexample to the conjecture that the maximum redundancy of the AIFVm codes is 1/m and an improvement Yuta Nakamura, Ueda Daichi, Kenichi Iwata (Univ. of Fukui), Hirosuke Yamamoto (The Univ. of Tokyo) IT202073 SIP202051 RCS2020164 
Hu, Yamamoto, and Honda proposed the binary AIFVm codes and proved that the redundancy of the optimal binary AIFVm cod... [more] 
IT202073 SIP202051 RCS2020164 pp.5863 
IT 
20201202 10:50 
Online 
Online 
Enumeration and Coding of Binary AIFVm Code Trees Genta Onishi, Kengo Hashimoto, Kenichi Iwata (Univ. of Fukui), Hirosuke Yamamoto (The Univ. of Tokyo) IT202033 
Using the onetoone correspondence between binary AIFV codes and Schröder paths, Sumigawa and Yamamoto gave a method to... [more] 
IT202033 pp.5055 
IT 
20201202 11:10 
Online 
Online 
On the Optimality of the AIFV Code for Average Codeword Length Kengo Hashimoto, Kenichi Iwata (Univ. of Fukui) IT202034 
McMillan's inequality proved that Huffman code attains an optimal average code length in a class of
source codes that ... [more] 
IT202034 pp.5661 
PN 
20200424 15:05 
Online 
Online 
[Invited Talk]
AIFV Code Construction Method and Optimization Method for Average Performance of Markov Chains with Finite States Kenichi Iwata, Ryusei Fujita (Univ. of Fukui), Hirosuke Yamamoto (Univ. of Tokyo) PN20203 
We describe a construction method to design the optimal binary AIFV codes, which are defined by Yamamoto, Tsuchihashi, H... [more] 
PN20203 pp.1521 
IT, SIP, RCS 
20200123 13:05 
Hiroshima 
Hiroshima City Youth Center 
On a redundancy of AIFVm codes
 for m=3,5  Ryusei Fujita, Kenichi Iwata (Univ. of Fukui), Hirosuke Yamamoto (Univ. of Tokyo) IT201948 SIP201961 RCS2019278 
(To be available after the conference date) [more] 
IT201948 SIP201961 RCS2019278 pp.7580 
RCS, SIP, IT 
20190201 10:50 
Osaka 
Osaka University 
Iterative Optimization Algorithm for Average Performance of Finite State Markov Chain Ryusei Fujita, Kenichi Iwata (Univ. of Fukui), Hirosuke Yamamoto (Meiji Univ.) IT201861 SIP201891 RCS2018268 
(To be available after the conference date) [more] 
IT201861 SIP201891 RCS2018268 pp.149154 
RCS, SIP, IT 
20190201 11:15 
Osaka 
Osaka University 
A Construction Method of the Optimal Code Trees for Binary Alphabetic AIFV Codes Yuya Nakanishi, Ryusei Fujita, Kenichi Iwata (Univ. of Fukui), Hirosuke Yamamoto (Meiji Univ.) IT201862 SIP201892 RCS2018269 
(To be available after the conference date) [more] 
IT201862 SIP201892 RCS2018269 pp.155160 
WBS, IT, ISEC 
20180308 13:25 
Tokyo 
Katsusika Campas, Tokyo University of Science 
Optimality for the Iterative Construction Scheme of AIFV$m$ codes Ryusei Fujita, Kenichi Iwata (Univ. of Fukui), Hirosuke Yamamoto (The Univ. of Tokyo) IT2017111 ISEC201799 WBS201792 
Yamamoto, Tsuchihashi, and Honda proposed binary AIFV (almost instantaneous fixedtovariable length) codes, which allow... [more] 
IT2017111 ISEC201799 WBS201792 pp.4954 
EMM, IT 
20170523 14:25 
Yamagata 
Yamagata University(Yonezawa Campus) 
A Dynamic Programming Algorithm to Construct Optimal Code Trees of Binary AIFVm Codes Takaya Kawai, Kenichi Iwata (Univ. of Fukui), Hirosuke Yamamoto (The Univ. of Tokyo) IT201714 EMM201714 
Yamamoto, Tsuchihashi, and Honda proposed binary almost instantaneous fixedtovariable length (AIFV) codes, which allow... [more] 
IT201714 EMM201714 pp.7984 
IT 
20160902 10:25 
Saga 
New Heartpia 
Construction, Encoding, and Decoding of Polar Codes with Multilevel Polarization for $q$Ary Input Generalized Erasure Channels Tomoyuki Kiuchi, Yuta Sakai, Kenichi Iwata (Univ. of Fukui) IT201636 
On polar codes, the size of the alphabet to be considered grows doubleexponentially with the number of polar transforma... [more] 
IT201636 pp.1318 
IT 
20160902 14:10 
Saga 
New Heartpia 
SpeedUp Method for Optimal Quantizations of BinaryInput Discrete Memoryless Channels with Monge Property Yuta Sakai, Kenichi Iwata (Univ. of Fukui) IT201640 
This study examines quantizations for outputs of binaryinput discrete memoryless channels (BDMCs) by concatenating a D... [more] 
IT201640 pp.3540 
IT, EMM 
20160520 10:15 
Hokkaido 
Otaru Economic Center 
A Sharp Bound Between Two Arimoto's Conditional Renyi Entropies with Distinct Positive Orders Yuta Sakai, Kenichi Iwata (Univ. of Fukui) IT201611 EMM201611 
In information theory, information measures for random variables, such as the Shannon entropy and the Rényi entropy, are... [more] 
IT201611 EMM201611 pp.6368 
IT, EMM 
20160520 15:10 
Hokkaido 
Otaru Economic Center 
Optimization for the average performance of fivestate system with probabilistic transition Kenichi Iwata, Takato Kimura (Univ. of Fukui), Hirosuke Yamamoto (The Univ. of Tokyo) IT201618 EMM201618 
We consider an optimization problem for the average performance of a probabilistic transition system with n states. Supp... [more] 
IT201618 EMM201618 pp.103108 
IT, ISEC, WBS 
20160310 13:40 
Tokyo 
The University of ElectroCommunications 
Relations Between Conditional Shannon Entropy and Expectation of Norm and Their Applications Yuta Sakai, Kenichi Iwata (Univ. of Fukui) IT2015109 ISEC201568 WBS201592 
The paper investigates the extremal relations between the Shannon entropy and the $ell_{alpha}$norm. More precisely, th... [more] 
IT2015109 ISEC201568 WBS201592 pp.4954 
IT 
20150904 14:25 
Ishikawa 
Hakusan Shobutei 
optimization for the average performance of threestate system with probabilistic transition Takato Kimura, Kenichi Iwata (Univ. of Fukui), Hirosuke Yamamoto (The Univ. of Tokyo) IT201542 
For a threestate system with probabilistic transition, we consider an optimization problem for the average performance ... [more] 
IT201542 pp.4954 
EMM, IT 
20150521 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, Kenichi Iwata (Univ. of Fukui) IT20152 EMM20152 
This study aims to clarify the extremal channels in the sense of channel reliability functions for some class of channel... [more] 
IT20152 EMM20152 pp.712 
ISEC, IT, WBS 
20150302 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, Kenichi Iwata (Univ. of Fukui) IT201486 ISEC201499 WBS201478 
Some quantization techniques are used in channel coding system to reduce the complexity of coding problem.
Kurkoski and... [more] 
IT201486 ISEC201499 WBS201478 pp.153158 
IT 
20150130 13:25 
Chiba 

Range of Symmetric Capacity and Reliability Functions for TernaryInput Discrete Memoryless Channels with Uniform Input Distribution Yuta Sakai, Kenichi Iwata (Univ. of Fukui) IT201455 
F`{a}bregas, Land, Martinez revealed that binary symmetric channels and binary erasure channels are extremal channels in... [more] 
IT201455 pp.712 
IT 
20140718 14:25 
Hyogo 
Kobe University 
On Quantization by Greedy Combining for Outputs of Discrete Memoryless Channels Yuta Sakai, Kenichi Iwata (Univ. of Fukui) IT201434 
Some quantization techniques are used in practice system to reduce the complexity of coding problem.
Kurkoski and Yagi ... [more] 
IT201434 pp.127132 