| 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 # | |
| WBS, IT, ISEC | 2021-03-04 13:20 |
Online | Online | [Poster Presentation]
Non-asymptotic converse theorem on the overflow probability of variable-to-fixed length codes Shota Saito, Toshiyasu Matsushima (Waseda Univ.)  IT2020-130 ISEC2020-60 WBS2020-49 |
This study considers variable-to-fixed length codes and investigates the non-asymptotic converse theorem on the threshol... [more] | IT2020-130 ISEC2020-60 WBS2020-49 pp.115-116 |
| SIS, IPSJ-AVM, ITE-3DMT [detail] | 2020-06-03 16:30 |
Online | Online | [Invited Talk]
Data compression and pattern matching Takuya Kida (Hokkai-Gakuen Univ.) SIS2020-5 |
(To be available after the conference date) [more] | SIS2020-5 pp.25-30 |
| IT | 2019-09-06 11:10 |
Oita | Yufuin Kenshujo, Nippon Bunri University | A Study on Variable-to-Fixed Length Coding of General Sources Shigeaki Kuzuoka (Wakayama Univ.) IT2019-29 |
Variable-to-fixed length (VF) coding of General Sources is studied. In particular, the overflow probability, i.e., the ... [more] |
IT2019-29 pp.19-22 |
| IT, EMM | 2016-05-20 11:05 |
Hokkaido | Otaru Economic Center | Construction of A Two-Step Universal VV Code Using a Sufficient Statistic Extracted from a VF Code Mitsuharu Arimura (Shonan Inst. Tech.), Hiroshi Nagaoka (Univ. of Electro-Communications) IT2016-13 EMM2016-13 |
In this paper, some theorems which give relationships between a sufficient statistic and the universality of a VV source... [more] | IT2016-13 EMM2016-13 pp.75-80 |
| IT | 2015-07-13 11:15 |
Tokyo | Tokyo Institute of Technology | An Improvement on the Almost Sure Convergence Coding Theorems of One-shot and Multi-shot Tunstall Codes Mitsuharu Arimura (Shonan Inst. Tech.) IT2015-20 |
Almost sure convergence coding theorem have been proved for one-shot and multi-shot Tunstall codes. In the theorems, it ... [more] | IT2015-20 pp.17-22 |
| IT | 2013-05-24 15:10 |
Fukui | Hotel Matuya Sensen at Awara-onsen, Fukui Pref. | On the Existence Condition of a VF Code for an Infinite-Alphabet Source Mitsuharu Arimura (Shonan Inst. of Tech.), Ken-ichi Iwata (Fukui Univ.) IT2013-9 |
In this paper, the performance of a variable-to-fixed length code (VF code) for a general source with countably infin... [more] |
IT2013-9 pp.41-46 |
| IT, ISEC, WBS | 2010-03-05 11:40 |
Nagano | Nagano-Engineering Campus, Shinshu University | On the Redundancy Rate of FF and VF Source Codes for General Sources Mitsuharu Arimura (Shonan Inst. of Tech.), Ken-ichi Iwata (Univ. of Fukui) IT2009-136 ISEC2009-144 WBS2009-115 |
This paper is concerned with the redundancy rate of fixed length source code for a general source with a countably infin... [more] | IT2009-136 ISEC2009-144 WBS2009-115 pp.413-418 |
| COMP | 2009-06-29 10:00 |
Hokkaido | Hokkaido University | Compressed Pattern Matching on VF Codes Takuya Kida (Hokkaido Univ.) COMP2009-18 |
We discuss the problem of pattern matching on a VF coded text. We introduce a KMP-type pattern matching algorithm that r... [more] | COMP2009-18 pp.1-8 |
[Return to Top Page]