| 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, EMM | 2024-05-30 13:40 |
Chiba | Chiba University (Nishi-Chiba Campus) | 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) |
[more] | |
| IT, EMM | 2024-05-30 16:00 |
Chiba | Chiba University (Nishi-Chiba Campus) | Asymmetric encoding-decoding schemes for Markov sources Hirosuke Yamamoto (U. of Tokyo), Ken-ichi Iwata (U.of Fukui) |
[more] | |
| IT | 2023-08-03 14:30 |
Kanagawa | Shonan Institute of Technology (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:25 |
Yamaguchi | (Primary: On-site, Secondary: Online) |
A Greedy Algorithm for the Minimum-Entropy Coupling Problem Taisei Shibata, Ken-ichi Iwata, Kengo Hashimoto (Univ. Fukui) IT2022-101 ISEC2022-80 WBS2022-98 RCC2022-98 |
The Minimum-Entropy coupling problem is the problem of finding a joint distribution that achieves the minimum entropy fo... [more] | IT2022-101 ISEC2022-80 WBS2022-98 RCC2022-98 pp.212-217 |
| 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 |
| WBS, IT, ISEC | 2021-03-05 14:20 |
Online | Online | Improvement of Cicalese-Gargano-Vaccaro Algorithm for the Minimum-Entropy Couplings Problem Kohei Sakatani, Ken-ichi Iwata (Univ. of Fukui), Hiroshi Fujisaki (Kanazawa Univ.) IT2020-151 ISEC2020-81 WBS2020-70 |
Minimum-Entropy coupling is a problem of finding a joint probability distribution of minimum entropy from the set of joi... [more] | IT2020-151 ISEC2020-81 WBS2020-70 pp.239-244 |
| SIP, IT, RCS | 2021-01-21 10:55 |
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 | 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 |
| IT, SIP, RCS | 2020-01-23 13:05 |
Hiroshima | Hiroshima City Youth Center | 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 | 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 |
| 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 |
| 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 |
| IT | 2016-09-02 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, Ken-ichi Iwata (Univ. of Fukui) IT2016-36 |
On polar codes, the size of the alphabet to be considered grows double-exponentially with the number of polar transforma... [more] | IT2016-36 pp.13-18 |
| IT | 2016-09-02 14:10 |
Saga | New Heartpia | Speed-Up Method for Optimal Quantizations of Binary-Input Discrete Memoryless Channels with Monge Property Yuta Sakai, Ken-ichi Iwata (Univ. of Fukui) IT2016-40 |
This study examines quantizations for outputs of binary-input discrete memoryless channels (B-DMCs) by concatenating a D... [more] | IT2016-40 pp.35-40 |
| IT, EMM | 2016-05-20 10:15 |
Hokkaido | Otaru Economic Center | A Sharp Bound Between Two Arimoto's Conditional Renyi Entropies with Distinct Positive Orders Yuta Sakai, Ken-ichi Iwata (Univ. of Fukui) IT2016-11 EMM2016-11 |
In information theory, information measures for random variables, such as the Shannon entropy and the Rényi entropy, are... [more] | IT2016-11 EMM2016-11 pp.63-68 |
| IT, EMM | 2016-05-20 15:10 |
Hokkaido | Otaru Economic Center | 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, ISEC, WBS | 2016-03-10 13:40 |
Tokyo | The University of Electro-Communications | Relations Between Conditional Shannon Entropy and Expectation of Norm and Their Applications Yuta Sakai, Ken-ichi Iwata (Univ. of Fukui) IT2015-109 ISEC2015-68 WBS2015-92 |
The paper investigates the extremal relations between the Shannon entropy and the $ell_{alpha}$-norm. More precisely, th... [more] | IT2015-109 ISEC2015-68 WBS2015-92 pp.49-54 |
[Return to Top Page]