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 41  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
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
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
EMM, IT 2015-05-21
10:40
Kyoto Kyoto International Community House Feasible regions of symmetric capacity and Gallager's $E_{0}$ functions for discrete memoryless channels under a uniform input distribution
Yuta Sakai, Ken-ichi Iwata (Univ. of Fukui) IT2015-2 EMM2015-2
This study aims to clarify the extremal channels in the sense of channel reliability functions for some class of channel... [more] IT2015-2 EMM2015-2
pp.7-12
ISEC, IT, WBS 2015-03-02
16:40
Fukuoka The University of Kitakyushu Algorithms to reduce the number of output symbols on condition that discrete memoryless channel satisfies admissible mutual information
Takumi Nagahara, Yuta Sakai, Ken-ichi Iwata (Univ. of Fukui) IT2014-86 ISEC2014-99 WBS2014-78
Some quantization techniques are used in channel coding system to reduce the complexity of coding problem.
Kurkoski and... [more]
IT2014-86 ISEC2014-99 WBS2014-78
pp.153-158
IT 2015-01-30
13:25
Chiba   Range of Symmetric Capacity and Reliability Functions for Ternary-Input Discrete Memoryless Channels with Uniform Input Distribution
Yuta Sakai, Ken-ichi Iwata (Univ. of Fukui) IT2014-55
F`{a}bregas, Land, Martinez revealed that binary symmetric channels and binary erasure channels are extremal channels in... [more] IT2014-55
pp.7-12
IT 2014-07-18
14:25
Hyogo Kobe University On Quantization by Greedy Combining for Outputs of Discrete Memoryless Channels
Yuta Sakai, Ken-ichi Iwata (Univ. of Fukui) IT2014-34
Some quantization techniques are used in practice system to reduce the complexity of coding problem.
Kurkoski and Yagi ... [more]
IT2014-34
pp.127-132
 Results 1 - 20 of 41  /  [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