| 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 # | |
| RCC, ISEC, IT, WBS | 2023-03-14 13:50 |
Yamaguchi | (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 | 2020-12-02 10:50 |
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 |
| IT | 2020-12-02 11:10 |
Online | Online | On the Optimality of the AIFV Code for Average Codeword Length Kengo Hashimoto, Ken-ichi Iwata (Univ. of Fukui) IT2020-34 |
McMillan's inequality proved that Huffman code attains an optimal average code length in a class of source codes that ... [more] |
IT2020-34 pp.56-61 |
| PN | 2020-04-24 15:05 |
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 |
| RCS, SIP, IT | 2019-02-01 10:50 |
Osaka | Osaka University | 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 | 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-09-05 10:35 |
Iwate | Seionsou | On searching for optimal non-alphabetic arithmetic codes based on A* algorithm Naohiro Uchida, Mikihiko Nishiara (Shinshu Univ.) IT2018-30 |
Arithmetic codes are known as alphabetic codes.In this report, we expand alphabetic arithmetic codes into non-alphabetic... [more] | IT2018-30 pp.19-23 |
| IT | 2018-07-19 16:20 |
Nara | Yamato Kaigishitsu | 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 | 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-09-08 14:25 |
Yamaguchi | Centcore Yamaguchi Hotel | 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) | 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 |
[Return to Top Page]