Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
IT |
2023-08-03 13:00 |
Kanagawa |
Shonan Institute of Technology (Primary: On-site, Secondary: Online) |
New Hybrid-II ARQ Schemes for the Z-Channel and Their Performance Evaluations Xiao Yu, Tomohiko Uyematsu (Tokyo Tech) IT2023-14 |
The $Z$-channel is a typical binary asymmetric channel, where only 1→0 errors are possible. In this channel, the combina... [more] |
IT2023-14 pp.1-6 |
EMM, IT |
2023-05-12 13:25 |
Kyoto |
Rakuyu Kaikan (Kyoto Univ. Yoshida-South Campus) (Primary: On-site, Secondary: Online) |
Equivalences among Some Information Measures for Individual Sequences and Their Applications for Fixed-Length Coding Problems Tomohiko Uyematsu (Tokyo Tech.), Tetsunao Matsuta (Saitama Univ.) IT2023-12 EMM2023-12 |
This paper proposes three new information measures for
individual sequences and clarifies their properties.
Our new ... [more] |
IT2023-12 EMM2023-12 pp.61-66 |
IT, RCS, SIP |
2023-01-24 10:00 |
Gunma |
Maebashi Terrsa (Primary: On-site, Secondary: Online) |
A hierarchical construction of typical linear codes Kaito Suzuki, Tomohiko Uyematsu (Tokyo Tech.) IT2022-35 SIP2022-86 RCS2022-214 |
According to Shannon's channel coding theorem, a channel has an inherent amount called a channel capacity which is deter... [more] |
IT2022-35 SIP2022-86 RCS2022-214 pp.36-41 |
IT, ISEC, RCC, WBS |
2022-03-10 10:30 |
Online |
Online |
Performance Evaluation of Random Codes and Polar Codes in Channels with Constraints on Time and Energy of One Codeword Issei Yokosawa, Tomohiko Uyematsu (Tokyo Tech) IT2021-85 ISEC2021-50 WBS2021-53 RCC2021-60 |
The channel model used by Shannon and Gallager to derive channel coding theorem
had the unreality that the transmissio... [more] |
IT2021-85 ISEC2021-50 WBS2021-53 RCC2021-60 pp.13-18 |
RCS, SIP, IT |
2022-01-21 13:30 |
Online |
Online |
Slepian-Wolf Coding Theorems Considering Costs for Codewords Naoki Ueda, Tomohiko Uyematsu (Tokyo Tech) IT2021-81 SIP2021-89 RCS2021-249 |
Many codes used for source coding assume that the costs for transmitting and recording each symbol are uniform, and code... [more] |
IT2021-81 SIP2021-89 RCS2021-249 pp.295-300 |
WBS, IT, ISEC |
2018-03-08 10:50 |
Tokyo |
Katsusika Campas, Tokyo University of Science |
The Access Structure of a Secret Sharing Scheme Using Locally Repairable Codes Masanobu Nakata, Tomohiko Uyematsu, Tetsunao Matsuta (Tokyo Tech) IT2017-107 ISEC2017-95 WBS2017-88 |
As a method to distribute and preserve secret information, a secret sharing scheme provides high confidentiality and red... [more] |
IT2017-107 ISEC2017-95 WBS2017-88 pp.25-30 |
WBS, IT, ISEC |
2018-03-08 13:00 |
Tokyo |
Katsusika Campas, Tokyo University of Science |
Outage Capacity of a Two-User MIMO Interference Channel for Simultaneous Information and Energy Transfer Kengo Ikebata, Tomohiko Uyematsu (Tokyo Tech), Ryutaroh Matsumoto (Nagoya Univ), Tetsunao Matsuta (Tokyo Tech) IT2017-110 ISEC2017-98 WBS2017-91 |
In a two-user interference channel for simultaneous information and energy transfer, there are an ID (Information Decodi... [more] |
IT2017-110 ISEC2017-98 WBS2017-91 pp.43-48 |
ISEC, WBS, IT |
2017-03-09 16:50 |
Tokyo |
TOKAI University |
[Invited Talk]
On the Wyner-Ziv Coding Problem with Delayed Side Information Tetsunao Matsuta, Tomohiko Uyematsu (Tokyo Tech) IT2016-117 ISEC2016-107 WBS2016-93 |
Wyner-Ziv coding is a basic and typical source coding for multiple information sources. In Wyner-Ziv coding, the encoder... [more] |
IT2016-117 ISEC2016-107 WBS2016-93 pp.115-120 |
ISEC, WBS, IT |
2017-03-10 14:10 |
Tokyo |
TOKAI University |
Spectrum Sensing in Cooperative with Some Secondary Users Yuki Muranaka, Ryutaroh Matsumoto, Tetsunao Matsuta, Tomohiko Uyematsu (Tokyo Tech) IT2016-131 ISEC2016-121 WBS2016-107 |
The cognitive radio has attracted attention as a measure to utilize the radio spectrum more efficiently in order to cope... [more] |
IT2016-131 ISEC2016-121 WBS2016-107 pp.209-214 |
IT, ISEC, WBS |
2016-03-10 11:05 |
Tokyo |
The University of Electro-Communications |
Bayesian Estimation of the Virus Source of an Infection in a Network Using Any Prior Distribution Ryousuke Kido, Tetsunao Matsuta, Ryutaroh Matsumoto, Tomohiko Uyematsu (Tokyo Tech.) IT2015-104 ISEC2015-63 WBS2015-87 |
We model a phenomenon that a computer virus is spreading in a network as infection of the virus in a graph constructed o... [more] |
IT2015-104 ISEC2015-63 WBS2015-87 pp.19-24 |
IT, ISEC, WBS |
2016-03-10 14:05 |
Tokyo |
The University of Electro-Communications |
The Minimum Codelength of Multiple-Uniprior Index Coding Masaru Takahashi, Tetsunao Matsuta, Ryutaroh Matsumoto, Tomohiko Uyematsu (Tokyo Tech) IT2015-110 ISEC2015-69 WBS2015-93 |
Index coding for sharing information via satellite communication is considered. Each receiver knows some of the messages... [more] |
IT2015-110 ISEC2015-69 WBS2015-93 pp.55-60 |
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, ISEC, WBS |
2016-03-10 15:30 |
Tokyo |
The University of Electro-Communications |
Secrecy Rates for the Gaussian Wiretap Channel with an Energy Transfer Cooperative Jammer Tomoya Komiyama, Ryutaroh Matsumoto, Tetsunao Matsuta, Tomohiko Uyematsu (Tokyo Tech) IT2015-122 ISEC2015-81 WBS2015-105 |
Wireless secure communications based on the information-theoretic security are attracting much attention.
In this pape... [more] |
IT2015-122 ISEC2015-81 WBS2015-105 pp.131-136 |
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 16:00 |
Fukuoka |
The University of Kitakyushu |
Outage Capacity of a Two-User Interference Channel for Simultaneous Information and Energy Transfer Yutaka Osawa, Ryutaroh Matsumoto, Tetsunao Matsuta, Tomohiko Uyematsu (Tokyo Tech) IT2014-80 ISEC2014-93 WBS2014-72 |
Wireless energy transfer is attracting more attention. A two-user interference channel for simultaneous information and ... [more] |
IT2014-80 ISEC2014-93 WBS2014-72 pp.117-122 |
ISEC, IT, WBS |
2015-03-03 14:10 |
Fukuoka |
The University of Kitakyushu |
[Invited Talk]
Security of secret sharing schemes expressed in terms of the relative parameters of linear codes Jun Kurihara (KDDI R&D Labs), Ryutaroh Matsumoto, Tomohiko Uyematsu (Tokyo Tech.) IT2014-100 ISEC2014-113 WBS2014-92 |
[more] |
IT2014-100 ISEC2014-113 WBS2014-92 pp.239-246 |
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 |
2015-01-30 13:50 |
Chiba |
|
Finite Key Rate of B92 Quantum Key Distriburion Protocol Hiroaki Sasaki, Ryutaroh Matsumoto, Tomohiko Uyematsu (Tokyo Tech) IT2014-56 |
The B92 quantum key distribution protocol is known as a secret key sharing method with the information-theoretic securit... [more] |
IT2014-56 pp.13-18 |
IT |
2014-09-19 13:00 |
Chiba |
|
Revisiting the Rate-Distortion Theory Using Smooth Max Renyi Divergence Tomohiko Uyematsu, Tetsunao Matsuta (Tokyo Inst. of Tech.) IT2014-46 |
This paper clarifies the rate-distortion function for general sources
in terms of the smooth max Renyi divergence. To t... [more] |
IT2014-46 pp.31-36 |
IT |
2014-07-17 14:00 |
Hyogo |
Kobe University |
Maximum Multicast Throughput by Network Coding on Undirected Hypernetworks Hokuto Takahashi, Ryutaroh Matsumoto, Tomohiko Uyematsu (Tokyo Inst. of Tech.) IT2014-18 |
It is known that the problem of the maximum multicast rate by network coding on an undirected network can be formulated ... [more] |
IT2014-18 pp.37-42 |