|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
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] |
|
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 |
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 |
|
|
|
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]
|