Committee 
Date Time 
Place 
Paper Title / Authors 
Abstract 
Paper # 
IT 
20230803 14:30 
Kanagawa 
Shonan Institute of Technology (Primary: Onsite, Secondary: Online) 
An Asymmetric EncodingDecoding Scheme for Lossless Data Compression Hirosuke Yamamoto (Univ. of Tokyo), Kenichi Iwata (Univ. of Fukui) IT202317 
ANS (Asymmetric Numeral Systems) are new lossless datacompressioncoding systems that can achieve almost the same compr... [more] 
IT202317 pp.1722 
RCC, ISEC, IT, WBS 
20230314 13:50 
Yamaguchi 
(Primary: Onsite, Secondary: Online) 
A Construction Method of Alphabetic Codes Allowing Nbit Decoding Delays Daichi Ueda, Kenichi Iwata (Univ. of Fukui), Hirosuke Yamamoto (The Univ. of Tokyo) IT2022102 ISEC202281 WBS202299 RCC202299 
As an extension of the AIFV and AIFVm codes that allow decoding delay, Sugiura, Kamamoto, and Moriya proposed the Nbit... [more] 
IT2022102 ISEC202281 WBS202299 RCC202299 pp.218223 
IT, ISEC, RCC, WBS 
20220310 16:50 
Online 
Online 
[Special Invited Talk]
A spread of Information Theory Researches Hirosuke Yamamoto (U.Tokyo) IT2021103 ISEC202168 WBS202171 RCC202178 
We look back on the research themes dealt with in our researches of information theory for 47 years, and think about the... [more] 
IT2021103 ISEC202168 WBS202171 RCC202178 pp.117121 
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 
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 
IT 
20180719 16:20 
Nara 
Yamato Kaigishitsu 
Easy Construction of Binary AIFV Codes for Unequal Letter Costs Takahiro Yoshida (The Univ. Tokyo), Hirosuke Yamamoto (Meiji Univ.) IT201818 
In the case that the costs of letters (code symbols) 0 and 1 are equal, it is known that the AIFV code with two code tre... [more] 
IT201818 pp.3136 
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 
IT 
20171128 16:35 
Niigata 
Hotel ShiratamanoYu Senkei 
[Invited Talk]
AIFV Codes and Their Extended Codes Hirosuke Yamamoto (Univ. of Tokyo) IT201754 
In source coding based on a code tree, it was concluded from Kraft's and McMilan's theorems that
the Huffman code is t... [more] 
IT201754 pp.1926 
IT 
20170908 14:25 
Yamaguchi 
Centcore Yamaguchi Hotel 
Dynamic AIFV coding using a dynamic Huffman code Tomotaka Hiraoka, Hirosuke Yamamoto (The Univ. of Tokyo) IT201746 
Since AIFV codes attain better compression rate than Huffman codes, dynamic AIFV codes are expected to attain better com... [more] 
IT201746 pp.4348 
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, 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 
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 
ISEC, IT, WBS 
20150302 15:35 
Fukuoka 
The University of Kitakyushu 
(k,n)Threshold Secret Sharing Schemes to Detect Substitution Attacks Wataru Nakamura, Hirosuke Yamamoto (UTokyo) IT201479 ISEC201492 WBS201471 
This paper treats $(k,n)$threshold secret sharing schemes to detect substitution attacks. First a symbolwise coding sch... [more] 
IT201479 ISEC201492 WBS201471 pp.111116 
IT 
20150130 14:15 
Chiba 

Optimality Proof for the Iterative Construction Scheme of AIFV codes Hirosuke Yamamoto (UTokyo) IT201457 
[more] 
IT201457 pp.1922 
IT 
20140717 09:45 
Hyogo 
Kobe University 
Construction of Almost Instantaneous FV codes based on Integer Programming Masato Tsuchihasi, Hirosuke Yamamoto, Junya Honda (Univ. of Tokyo) IT201411 
The Almost Instantaneous FV (AIFV) code, which consists of
several code trees with incomplete internal nodes, can atta... [more] 
IT201411 pp.16 
IT 
20140717 14:25 
Hyogo 
Kobe University 
Extended LZW codes with Modified Reduplicative Parsing Yuta Takabayashi, Hirosuke Yamamoto (Univ. of Tokyo) IT201419 
The LZW code is categorized as the socalled dictionary method in the universal data compression codes and is used in G... [more] 
IT201419 pp.4348 