| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: Recent 10 Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| RCS, SIP, IT | 2025-01-30 11:20 |
Yamaguchi | Kaikyou-messe (Yamaguchi, Online) (Primary: On-site, Secondary: Online) |
Alphabetic AIFV Codes for Unequal Bit Cost Kosei Shimizu, Kengo Hashimoto, Ken-ichi Iwata (Univ. of Fukui), Hirosuke Yamamoto (The Univ. of Tokyo)  IT2024-60 SIP2024-99 RCS2024-243 |
(To be available after the conference date) [more] | IT2024-60 SIP2024-99 RCS2024-243 pp.196-201 |
| IT, EMM | 2024-05-30 13:40 |
Chiba | Chiba University (Nishi-Chiba Campus) (Chiba) | Maximum redundancy of ternary AIFV codes is 1/2 Mayu Mori, Kengo Hashimoto, Ken-ichi Iwata (Univ. of Fukui), Hirosuke Yamamoto (The Univ. of Tokyo) IT2024-3 EMM2024-3 |
As almost instantaneous codes, Yamamoto et al. proposed k-nary AIFV codes in 2015 that are uniquely decodable with a dec... [more] | IT2024-3 EMM2024-3 pp.13-17 |
| IT, EMM | 2024-05-30 16:00 |
Chiba | Chiba University (Nishi-Chiba Campus) (Chiba) | Asymmetric encoding-decoding schemes for first-order Markov sources Hirosuke Yamamoto (U. of Tokyo), Ken-ichi Iwata (U.of Fukui) IT2024-5 EMM2024-5 |
Last year we proposed an Asymmetric Encoding--Decoding Scheme (AEDS), in which a data sequence $s^T=s_1s_2 ¥cdots s_T$ i... [more] | IT2024-5 EMM2024-5 pp.19-24 |
| IT | 2023-08-03 14:30 |
Kanagawa | Shonan Institute of Technology (Kanagawa, Online) (Primary: On-site, Secondary: Online) |
An Asymmetric Encoding-Decoding Scheme for Lossless Data Compression Hirosuke Yamamoto (Univ. of Tokyo), Ken-ichi Iwata (Univ. of Fukui) IT2023-17 |
ANS (Asymmetric Numeral Systems) are new lossless data-compression-coding systems that can achieve almost the same compr... [more] | IT2023-17 pp.17-22 |
| RCC, ISEC, IT, WBS | 2023-03-14 13:50 |
Yamaguchi | (Yamaguchi, Online) (Primary: On-site, Secondary: Online) |
A Construction Method of Alphabetic Codes Allowing N-bit Decoding Delays Daichi Ueda, Ken-ichi Iwata (Univ. of Fukui), Hirosuke Yamamoto (The Univ. of Tokyo) IT2022-102 ISEC2022-81 WBS2022-99 RCC2022-99 |
As an extension of the AIFV and AIFV-m codes that allow decoding delay, Sugiura, Kamamoto, and Moriya proposed the N-bit... [more] | IT2022-102 ISEC2022-81 WBS2022-99 RCC2022-99 pp.218-223 |
| IT, ISEC, RCC, WBS | 2022-03-10 16:50 |
Online | Online (Online) | [Special Invited Talk]
A spread of Information Theory Researches Hirosuke Yamamoto (U.Tokyo) IT2021-103 ISEC2021-68 WBS2021-71 RCC2021-78 |
We look back on the research themes dealt with in our researches of information theory for 47 years, and think about the... [more] | IT2021-103 ISEC2021-68 WBS2021-71 RCC2021-78 pp.117-121 |
| SIP, IT, RCS | 2021-01-21 10:55 |
Online | Online (Online) | A counterexample to the conjecture that the maximum redundancy of the AIFV-m codes is 1/m and an improvement Yuta Nakamura, Ueda Daichi, Ken-ichi Iwata (Univ. of Fukui), Hirosuke Yamamoto (The Univ. of Tokyo) IT2020-73 SIP2020-51 RCS2020-164 |
Hu, Yamamoto, and Honda proposed the binary AIFV-m codes and proved that the redundancy of the optimal binary AIFV-m cod... [more] | IT2020-73 SIP2020-51 RCS2020-164 pp.58-63 |
| IT | 2020-12-02 10:50 |
Online | Online (Online) | Enumeration and Coding of Binary AIFV-m Code Trees Genta Onishi, Kengo Hashimoto, Ken-ichi Iwata (Univ. of Fukui), Hirosuke Yamamoto (The Univ. of Tokyo) IT2020-33 |
Using the one-to-one correspondence between binary AIFV codes and Schröder paths, Sumigawa and Yamamoto gave a method to... [more] | IT2020-33 pp.50-55 |
| PN | 2020-04-24 15:05 |
Online | Online (Online) | [Invited Talk]
AIFV Code Construction Method and Optimization Method for Average Performance of Markov Chains with Finite States Ken-ichi Iwata, Ryusei Fujita (Univ. of Fukui), Hirosuke Yamamoto (Univ. of Tokyo) PN2020-3 |
We describe a construction method to design the optimal binary AIFV codes, which are defined by Yamamoto, Tsuchihashi, H... [more] | PN2020-3 pp.15-21 |
| IT, SIP, RCS | 2020-01-23 13:05 |
Hiroshima | Hiroshima City Youth Center (Hiroshima) | On a redundancy of AIFV-m codes
-- for m=3,5 -- Ryusei Fujita, Ken-ichi Iwata (Univ. of Fukui), Hirosuke Yamamoto (Univ. of Tokyo) IT2019-48 SIP2019-61 RCS2019-278 |
(To be available after the conference date) [more] | IT2019-48 SIP2019-61 RCS2019-278 pp.75-80 |
| RCS, SIP, IT | 2019-02-01 10:50 |
Osaka | Osaka University (Osaka) | Iterative Optimization Algorithm for Average Performance of Finite State Markov Chain Ryusei Fujita, Ken-ichi Iwata (Univ. of Fukui), Hirosuke Yamamoto (Meiji Univ.) IT2018-61 SIP2018-91 RCS2018-268 |
(To be available after the conference date) [more] | IT2018-61 SIP2018-91 RCS2018-268 pp.149-154 |
| RCS, SIP, IT | 2019-02-01 11:15 |
Osaka | Osaka University (Osaka) | A Construction Method of the Optimal Code Trees for Binary Alphabetic AIFV Codes Yuya Nakanishi, Ryusei Fujita, Ken-ichi Iwata (Univ. of Fukui), Hirosuke Yamamoto (Meiji Univ.) IT2018-62 SIP2018-92 RCS2018-269 |
(To be available after the conference date) [more] | IT2018-62 SIP2018-92 RCS2018-269 pp.155-160 |
| IT | 2018-07-19 16:20 |
Nara | Yamato Kaigishitsu (Nara) | Easy Construction of Binary AIFV Codes for Unequal Letter Costs Takahiro Yoshida (The Univ. Tokyo), Hirosuke Yamamoto (Meiji Univ.) IT2018-18 |
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] | IT2018-18 pp.31-36 |
| WBS, IT, ISEC | 2018-03-08 13:25 |
Tokyo | Katsusika Campas, Tokyo University of Science (Tokyo) | Optimality for the Iterative Construction Scheme of AIFV-$m$ codes Ryusei Fujita, Ken-ichi Iwata (Univ. of Fukui), Hirosuke Yamamoto (The Univ. of Tokyo) IT2017-111 ISEC2017-99 WBS2017-92 |
Yamamoto, Tsuchihashi, and Honda proposed binary AIFV (almost instantaneous fixed-to-variable length) codes, which allow... [more] | IT2017-111 ISEC2017-99 WBS2017-92 pp.49-54 |
| IT | 2017-11-28 16:35 |
Niigata | Hotel Shiratama-no-Yu Senkei (Niigata) | [Invited Talk]
AIFV Codes and Their Extended Codes Hirosuke Yamamoto (Univ. of Tokyo) IT2017-54 |
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] |
IT2017-54 pp.19-26 |
| IT | 2017-09-08 14:25 |
Yamaguchi | Centcore Yamaguchi Hotel (Yamaguchi) | Dynamic AIFV coding using a dynamic Huffman code Tomotaka Hiraoka, Hirosuke Yamamoto (The Univ. of Tokyo) IT2017-46 |
Since AIFV codes attain better compression rate than Huffman codes, dynamic AIFV codes are expected to attain better com... [more] | IT2017-46 pp.43-48 |
| EMM, IT | 2017-05-23 14:25 |
Yamagata | Yamagata University(Yonezawa Campus) (Yamagata) | A Dynamic Programming Algorithm to Construct Optimal Code Trees of Binary AIFV-m Codes Takaya Kawai, Ken-ichi Iwata (Univ. of Fukui), Hirosuke Yamamoto (The Univ. of Tokyo) IT2017-14 EMM2017-14 |
Yamamoto, Tsuchihashi, and Honda proposed binary almost instantaneous fixed-to-variable length (AIFV) codes, which allow... [more] | IT2017-14 EMM2017-14 pp.79-84 |
| IT, EMM | 2016-05-20 15:10 |
Hokkaido | Otaru Economic Center (Hokkaido) | Optimization for the average performance of five-state system with probabilistic transition Ken-ichi Iwata, Takato Kimura (Univ. of Fukui), Hirosuke Yamamoto (The Univ. of Tokyo) IT2016-18 EMM2016-18 |
We consider an optimization problem for the average performance of a probabilistic transition system with n states. Supp... [more] | IT2016-18 EMM2016-18 pp.103-108 |
| IT | 2015-09-04 14:25 |
Ishikawa | Hakusan Shobutei (Ishikawa) | 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 |
| ISEC, IT, WBS | 2015-03-02 15:35 |
Fukuoka | The University of Kitakyushu (Fukuoka) | (k,n)-Threshold Secret Sharing Schemes to Detect Substitution Attacks Wataru Nakamura, Hirosuke Yamamoto (UTokyo) IT2014-79 ISEC2014-92 WBS2014-71 |
This paper treats $(k,n)$-threshold secret sharing schemes to detect substitution attacks. First a symbolwise coding sch... [more] | IT2014-79 ISEC2014-92 WBS2014-71 pp.111-116 |
[Return to Top Page]