| 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 # | |
| QIT (2nd) |
2022-12-09 18:15 |
Kanagawa | Keio Univ. (Primary: On-site, Secondary: Online) |
Secure multi-party quantum computation based on triorthogonal quantum error-correcting codes Petr Mishchenko, Keita Xagawa (NTT) |
Secure multi-party quantum computation (MPQC) protocol is a versatile tool that enables error-free distributed quantum c... [more] | |
| WBS, IT, ISEC | 2021-03-04 10:55 |
Online | Online | An Efficient Bayes Coding Algorithm for the Source Based on Context Tree Models that Vary from Section to Section Koshi Shimada, Shota Saito, Toshiyasu Matsushima (Waseda Univ.)  IT2020-115 ISEC2020-45 WBS2020-34 |
In this paper, we present an efficient coding algorithm for a non-stationary source based on context tree models that ve... [more] | IT2020-115 ISEC2020-45 WBS2020-34 pp.19-24 |
| WBS, IT, ISEC | 2018-03-08 10:15 |
Tokyo | Katsusika Campas, Tokyo University of Science | Evaluation of the Worst-Case Redundancy of Strongly Universal FV Source Codes Using the Source Approximation and the Asymptotically Sufficient Statistic Mitsuharu Arimura (Shonan Inst. Tech.), Hiroshi Nagaoka (Univ. of Electro-Comm.) IT2017-106 ISEC2017-94 WBS2017-87 |
The universality of some variations of two-step lossless source codes using asymptotically sufficient statistics were pr... [more] | IT2017-106 ISEC2017-94 WBS2017-87 pp.19-24 |
| IT | 2017-07-13 16:20 |
Chiba | Chiba University | [Invited Talk]
Compression by Substring Enumeration and its Related Methods Hidetoshi Yokoo (Gunma Univ.) IT2017-26 |
This paper surveys the universal data compression method known as Compression by Substring Enumeration (CSE), developed ... [more] | IT2017-26 pp.55-60 |
| 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 |
| COMP | 2015-09-01 11:00 |
Nagano | Generalization of Efficient Implementation of Compression by Substring Enumeration
-- Finite Alphabet and Explicit Phase Awareness -- Shumpei Sakuma, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.) COMP2015-18 |
CSE (Compression by Substring Enumeration), a lossless universal compression scheme was introduced by Dub'e and Beaudoin... [more] | COMP2015-18 pp.13-20 |
|
| IT | 2014-07-17 14:25 |
Hyogo | Kobe University | Extended LZW codes with Modified Reduplicative Parsing Yuta Takabayashi, Hirosuke Yamamoto (Univ. of Tokyo) IT2014-19 |
The LZW code is categorized as the so-called dictionary method in the universal data compression codes and is used in G... [more] | IT2014-19 pp.43-48 |
| IT | 2013-07-25 14:30 |
Tokyo | Nishi-Waseda campus, Waseda University | A Data Compression Scheme based on Reduplicative Parsing for Binary Sources Shigeru Maya, Hirosuke Yamamoto (Univ. of Tokyo) IT2013-14 |
The incremental parsing used in the LZ78 code can be implemented by the incremental parsing tree, and Yokoo showed that... [more] |
IT2013-14 pp.17-22 |
| HCGSYMPO (2nd) |
2012-12-10 - 2012-12-12 |
Kumamoto | Kumamoto-Shintoshin-plaza | Re-coloring methods based on visual effects and color vision characteristics Harumi Saito, Masahiro Watanabe, Yoko Asano (NTT) |
It is said that utilizing red as an indicator of emphasis and so on is not very effective because red looks very dark wi... [more] | |
| ISEC, IT, WBS | 2011-03-04 09:25 |
Osaka | Osaka University | A Practical Algorithm of Universal Source Coding by the Most Frequent Substring Tsuki Saito, Tetsunao Matsuta, Ryutaroh Matsumoto, Tomohiko Uyematsu (Tokyo Inst. of Tech) IT2010-105 ISEC2010-109 WBS2010-84 |
In the grammar based code proposed by Kieffer and Yang, a context-free grammar which only produces the input sequence is... [more] | IT2010-105 ISEC2010-109 WBS2010-84 pp.243-248 |
| IT, ISEC, WBS | 2010-03-05 16:35 |
Nagano | Nagano-Engineering Campus, Shinshu University | Construction of wiretap codes from ordinary channel codes Masahito Hayashi (Tohoku Univ./National Univ. of Singapore), Ryutaroh Matsumoto (Tokyo Inst. of Tech.) IT2009-144 ISEC2009-152 WBS2009-123 |
From an arbitrary given channel code over a discrete or Gaussian memoryless channel, we construct a wiretap code with t... [more] |
IT2009-144 ISEC2009-152 WBS2009-123 pp.461-465 |
| 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:50 |
Hokkaido | Hakodate Mirai Univ. | Universal Lossless Source Coding Based on Sequential Grammar Transforms Masaki Jono, Tomohiko Uyematsu, Ryutaroh Matsumoto (Tokyo Inst. of Tech.) IT2008-98 ISEC2008-156 WBS2008-111 |
The grammar-based code proposed by Kieffer and Yang is a large class of universal codes. Usually, the grammar-based cod... [more] |
IT2008-98 ISEC2008-156 WBS2008-111 pp.355-362 |
| IT | 2008-01-17 15:50 |
Tokyo | Waseda Univ. | Universal Coding Theorem for Relay Channels Toshifumi Sakai, Tomohiko Uyematsu (Tokyo Inst. of Tech.) IT2007-29 |
Relay channels are known as a model of multihop wireless networks which are often studied. In relay channels, the sende... [more] |
IT2007-29 pp.25-30 |
| WBS, IT, ISEC | 2006-03-16 08:30 |
Aichi | Nagoya Univ. | A Generalized-LSB Embedding Model for Universal Lossless Data Embedding Hidetoshi Yokoo, Shingo Mamada (Gunma Univ.) |
(To be available after the conference date) [more] | IT2005-85 ISEC2005-142 WBS2005-99 pp.123-128 |
| IT | 2005-07-22 15:20 |
Osaka | Osaka Prefecture Univ. | An Algorithm of Bayes Coding for FSMX Sources to Reduce Required Memory Size Akira Nakano, Naoto Kobayashi, Toshiyasu Matsushima (Waseda Univ.) |
Bayes code is one of universal source codings, such that a class of the probabilistic model of source is known but the p... [more] | IT2005-50 pp.47-52 |
| IT | 2004-07-29 11:20 |
Chiba | Tokyo Univ. (Kashiwa) | Redundancy of Bayes Coding for Nonstationary Sources with Piecewise Constant Parameters Tota Suko, Toshiyasu Matsushima, Shigeichi Hirasawa (Waseda Univ.) |
In this paper we treat universal source coding when the parameters of the probabilistic model of source are known. Baye... [more] |
IT2004-22 pp.23-28 |
[Return to Top Page]