Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
IT, RCS, SIP |
2023-01-24 10:25 |
Gunma |
Maebashi Terrsa (Primary: On-site, Secondary: Online) |
An improved context tree switching method by dynamic expansion and pruning of context tree Masaya Ootsu, Hideki Yagi (UEC) IT2022-36 SIP2022-87 RCS2022-215 |
The Context Tree Weighting (CTW) method is a sequential lossless universal coding algorithm for tree sources with good p... [more] |
IT2022-36 SIP2022-87 RCS2022-215 pp.42-47 |
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 |
IT |
2014-07-17 17:40 |
Hyogo |
Kobe University |
[Invited Talk]
How to Observe Probability Distribution of Self-Information
-- as viewed under different resolutions of $n^{-1}$ and $n^{-1/2}$ -- Toshiyasu Matsushima (Waseda Univ.) IT2014-26 |
Several problems in Information Theory are investigated by asymptotic approximations of the probability of self-informat... [more] |
IT2014-26 pp.83-88 |
IT, ISEC, WBS |
2013-03-07 10:30 |
Osaka |
Kwansei Gakuin Univ., Osaka-Umeda Campus |
Universal Coding for Asynchronous Slepian-Wolf Coding Systems Tetsunao Matsuta, Tomohiko Uyematsu (Tokyo Inst. of Tech.) IT2012-62 ISEC2012-80 WBS2012-48 |
Slepian-Wolf (SW) coding system is the most fundamental source coding system in multi-terminal information theory. In t... [more] |
IT2012-62 ISEC2012-80 WBS2012-48 pp.1-6 |
ISEC, IT, WBS |
2011-03-04 09:50 |
Osaka |
Osaka University |
A Generalized MDL Criterion and its Application to Learning Bayesian Network Structure
-- When Both Discrete and Continuous Data are Present -- Joe Suzuki (Osaka Univ.) IT2010-106 ISEC2010-110 WBS2010-85 |
We propose the MDL principle without assuming the source to be discrete.
As an application, we consider estimation of B... [more] |
IT2010-106 ISEC2010-110 WBS2010-85 pp.249-254 |
IT, ISEC, WBS |
2010-03-04 17:00 |
Nagano |
Nagano-Engineering Campus, Shinshu University |
Universal Slepian-Wolf Coding for General Sources Shigeaki Kuzuoka (Wakayama Univ.) IT2009-100 ISEC2009-108 WBS2009-79 |
Slepian-Wolf (S-W) coding for general correlated sources is considered. Our main result demonstrates
the following fact... [more] |
IT2009-100 ISEC2009-108 WBS2009-79 pp.187-191 |
IT, ISEC, WBS |
2010-03-05 14:40 |
Nagano |
Nagano-Engineering Campus, Shinshu University |
Redundancy analysis of the universal source code with a singular prior Tatsuya Hashimoto, Tsutomu Kawabata (Univ. of Electro-Comm.) IT2009-125 ISEC2009-133 WBS2009-104 |
We consider the universal source coding with the class of source whose probability is parameterized over a continuous sp... [more] |
IT2009-125 ISEC2009-133 WBS2009-104 pp.349-352 |
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 |
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 |
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 |