|
|
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 # |
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, EMM |
2016-05-20 10:40 |
Hokkaido |
Otaru Economic Center |
A Grammar-Based Data Compression Algorithm Using Chomsky Normal Form of Context Free Grammar Mitsuharu Arimura (Shonan Inst. Tech.) IT2016-12 EMM2016-12 |
This paper proposes a new class of grammar-based lossless source code. For the simplicity, a Semi-Chomsky Normal Form (s... [more] |
IT2016-12 EMM2016-12 pp.69-74 |
IT, ISEC, WBS |
2013-03-07 13:40 |
Osaka |
Kwansei Gakuin Univ., Osaka-Umeda Campus |
Maximum Redundancy of Lossless Data Compression via Substring Enumeration for Markov Sources Ken-ichi Iwata (Univ. of Fukui), Mitsuharu Arimura (Shonan Inst. Tech.), Yuki Shima (Univ. of Fukui) IT2012-76 ISEC2012-94 WBS2012-62 |
Dub\'{e} and Beaudoin proposed a technique of lossless data compression called compression via substring enumeration (CS... [more] |
IT2012-76 ISEC2012-94 WBS2012-62 pp.95-100 |
|
|
|
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]
|