| 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 # | |
| SIP, IT, RCS | 2021-01-21 15:45 |
Online | Online | [Special Invited Talk]
Turbo Equalization to Lossless/Lossy Distributed Multiterminal Source Coding: How are they connected?
-- Towards Distributed Hypothesis Testing over IoT Networks -- Tadashi Matsumoto (JAIST)  IT2020-80 SIP2020-58 RCS2020-171 |
A goal of this talk is to provide the audience with the knowledge about how the presenter's research experiences and foo... [more] | IT2020-80 SIP2020-58 RCS2020-171 p.99 |
| IT, ISEC, WBS | 2019-03-07 09:30 |
Tokyo | University of Electro-Communications | Analysis of Zero-Redundancy Estimator with a Finite Window for Markovian Source
-- When the Statewise Alphabets are Unknown -- Yusuke Hashimoto, Tstutomu Kawabata (Univ. of Electro-Comm.) IT2018-89 ISEC2018-95 WBS2018-90 |
A Bayesian (Laplace or Krichevski-Trofimov) estimator for Markov source can be used to build a lossless source code. Ho... [more] |
IT2018-89 ISEC2018-95 WBS2018-90 pp.85-90 |
| 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, 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 |
| SIS, IPSJ-AVM | 2015-09-03 14:00 |
Osaka | Kansai Univ. | A Study on Lossless coding for Binary Holographic Interference Fringes Takahiro Nishigaito, Mitsuji Muneyasu, Kyoji Matsushima (Kansai Univ.), Akira Taguchi (Tokyo City Univ.) SIS2015-19 |
This paper studies a compression technique for binary holographic interference fringes. Computer generating holography i... [more] | SIS2015-19 pp.25-30 |
| 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 |
| SIS | 2015-06-09 11:30 |
Nagasaki | Arkas SASEBO | Layered Lossless Video Coding based on Distributed Source Coding Theorem Takayuki Nakachi, Tatsuya Fujii (NTT) SIS2015-13 |
The distributed source coding (DSC) theorem concerns encoding of correlated information sources, without letting the sou... [more] | SIS2015-13 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 |
| IT | 2009-05-29 14:40 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Relations between Universal FV and FF Source Codes Shigeaki Kuzuoka (Wakayama Univ.) IT2009-2 |
Universal lossless source coding for general sources are considered. Our results reveal that the definition of the univ... [more] |
IT2009-2 pp.7-12 |
| WBS, IT, ISEC | 2009-03-10 09:25 |
Hokkaido | Hakodate Mirai Univ. | A Necessary and Sufficient Condition for the Existence of a Universal Fixed-Rate Lossless Code Shigeaki Kuzuoka (Wakayama Univ.) IT2008-97 ISEC2008-155 WBS2008-110 |
In this paper, a generalized version of fixed-rate lossless source coding, that is, $\varepsilon$-source coding of gener... [more] | IT2008-97 ISEC2008-155 WBS2008-110 pp.349-354 |
| IT | 2006-07-27 15:00 |
Chiba | Univ. of Tokyo | Data Compression Using Antidictionary for Finite-Alphabet Sources Takahiro Ota (Pit-Nagano), Hiroyoshi Morita (UEC) |
An antidictionary is a set of words of minimal length that never appear in this string. And it is known that the antid... [more] | IT2006-31 pp.37-42 |
| WBS, IT, ISEC | 2006-03-16 09:20 |
Aichi | Nagoya Univ. | Data Compression Using Source Model Based on Antidictionary Tree Takahiro Ota (Pit-Nagano), Hiroyoshi Morita (UEC) |
Data compression method using source model based on the automaton used antidictionary coding is proposed. However, the a... [more] | IT2005-87 ISEC2005-144 WBS2005-101 pp.135-140 |
| IT | 2005-07-22 14:55 |
Osaka | Osaka Prefecture Univ. | Data Compression by Arithmetic Coding and Source Modeling based on the Anti-Dictionary Method Noriyuki Ohkawa, Kunihiko Harada, Hirosuke Yamamoto (Univ. of Tokyo) |
Generally, the anti-dictionary method can't archive high compression rate except the case that a data sequence can be mo... [more] | IT2005-49 pp.41-46 |
[Return to Top Page]