IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 20 of 48  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
IT, ISEC, RCC, WBS 2022-03-10
16:50
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 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
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
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-11-28
16:35
Niigata Hotel Shiratama-no-Yu Senkei [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 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
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 2015-09-04
14:25
Ishikawa Hakusan Shobutei 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 (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
IT 2015-01-30
14:15
Chiba   Optimality Proof for the Iterative Construction Scheme of AIFV codes
Hirosuke Yamamoto (UTokyo) IT2014-57
 [more] IT2014-57
pp.19-22
IT 2014-07-17
09:45
Hyogo Kobe University Construction of Almost Instantaneous FV codes based on Integer Programming
Masato Tsuchihasi, Hirosuke Yamamoto, Junya Honda (Univ. of Tokyo) IT2014-11
The Almost Instantaneous FV (AIFV) code, which consists of
several code trees with incomplete internal nodes, can atta... [more]
IT2014-11
pp.1-6
IT 2014-07-17
14:25
Hyogo Kobe University Extended LZW codes with Modified Reduplicative Parsing
Yuta Takabayashi, Hirosuke Yamamoto (Univ. of Tokyo) IT2014-19
The LZW code is categorized as the so-called dictionary method in the universal data compression codes and is used in G... [more] IT2014-19
pp.43-48
IT 2013-07-25
13:50
Tokyo Nishi-Waseda campus, Waseda University New Identification Codes based on Strongly Universal Classes of Hash Functions
Masashi Ueda, Hirosuke Yamamoto (Univ. of Tokyo) IT2013-13
 [more] IT2013-13
pp.11-16
IT 2013-07-25
14:30
Tokyo Nishi-Waseda campus, Waseda University A Data Compression Scheme based on Reduplicative Parsing for Binary Sources
Shigeru Maya, Hirosuke Yamamoto (Univ. of Tokyo) IT2013-14
The incremental parsing used in the LZ78 code can be implemented by the incremental parsing tree,
and Yokoo showed that... [more]
IT2013-14
pp.17-22
 Results 1 - 20 of 48  /  [Next]  
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan