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 |
ISEC, IT, WBS |
2020-03-11 11:45 |
Hyogo |
University of Hyogo (Cancelled but technical report was issued) |
A Note on the Relationship between Smooth Locally Decodable Codes and Private Information Retrieval Koki Kazama, Akira Kamatsuka (Waseda Univ.), Takahiro Yoshida (Yokohama Col. of Commerce), Toshiyasu Matsushima (Waseda Univ.) IT2019-120 ISEC2019-116 WBS2019-69 |
We focus on smooth locally decodable codes (SLDC) and Private Information Retrieval (PIR).
Recently, the relationship b... [more] |
IT2019-120 ISEC2019-116 WBS2019-69 pp.201-206 |
IT, ISEC, WBS |
2016-03-10 14:30 |
Tokyo |
The University of Electro-Communications |
Intrinsic Randomness Problem for Correlated General Sources Tomohiko Uyematsu, Tetsunao Matsuta (Tokyo Tech.) IT2015-111 ISEC2015-70 WBS2015-94 |
Muramatsu et~al. considered the problem of generating statistically independent random numbers from two correlated memor... [more] |
IT2015-111 ISEC2015-70 WBS2015-94 pp.61-66 |
IT |
2015-07-13 16:00 |
Tokyo |
Tokyo Institute of Technology |
[Invited Talk]
Reformulation of Information Theory by New Information Measures Tomohiko Uyematsu (Tokyo Tech) IT2015-27 |
Han and Verd'u introduced a new information measure called as
information spectrum, and developed the most general info... [more] |
IT2015-27 pp.59-66 |
ISEC, IT, WBS |
2015-03-02 17:05 |
Fukuoka |
The University of Kitakyushu |
Another Representation on the Second-Order Achievable Rate Region of Slepian-Wolf Coding Problem for General Sources Shota Saito, Nozomi Miya, Toshiyasu Matsushima (Waseda Univ.) IT2014-87 ISEC2014-100 WBS2014-79 |
In this paper, we deal with the Slepian-Wolf coding problem for general sources. Previously, the first-order $epsilon$-a... [more] |
IT2014-87 ISEC2014-100 WBS2014-79 pp.159-165 |
IT |
2015-01-30 13:00 |
Chiba |
|
The second order asymptotic rates in intrinsic randomness problem in terms of smooth Renyi entropy Eiichi Namekawa, Tomohiko Uyematsu (Tokyo Tech) IT2014-54 |
The intrinsic randomness problem is to approximately generate uniform random numbers from output sequences of a general ... [more] |
IT2014-54 pp.1-6 |
IT |
2013-07-26 09:45 |
Tokyo |
Nishi-Waseda campus, Waseda University |
Intrinsic Randomness in Terms of Smooth Renyi Entropy Shohei Kunimatsu, Tomohiko Uyematsu, Ryutaroh Matsumoto (Tokyo Inst. of Tech.) IT2013-20 |
Intrinsic randomness problems for general sources are to approximately generate uniform random symbols from source outpu... [more] |
IT2013-20 pp.43-48 |
IT |
2013-01-21 17:05 |
Tokyo |
Univ. of Electro-Communications |
The second order asymptotic rates in fixed-length source coding and resolvability problem in terms of smooth Renyi entropy Susumu Tagashira, Tomohiko Uyematsu (Tokyo Tech) IT2012-60 |
Fixed-length source coding problem is to convert source output sequences to fixed-length codewords. In stationary memory... [more] |
IT2012-60 pp.65-70 |
IT |
2010-05-21 11:20 |
Tokushima |
the University of Tokushima |
Smooth Renyi Entropy and Intrinsic Randomness Tomohiko Uyematsu (Tokyo Inst. of Tech.) IT2010-3 |
This paper deals with intrinsic randomness problem of general sources, and
establishes a new unified method for
intrin... [more] |
IT2010-3 pp.13-18 |
IT, ISEC, WBS |
2010-03-04 17:25 |
Nagano |
Nagano-Engineering Campus, Shinshu University |
Smooth Renyi Entropy and Resolvability Tomohiko Uyematsu (Tokyo Inst. of Tech.) IT2009-101 ISEC2009-109 WBS2009-80 |
This paper deals with resolvability problem of general sources, and establishes a new unified method for resolvability p... [more] |
IT2009-101 ISEC2009-109 WBS2009-80 pp.193-198 |