| 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 # | |
| 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 |
| ISEC, IT, WBS | 2014-03-11 13:20 |
Aichi | Nagoya Univ., Higashiyama Campus | On the Outage Energy Efficiency of Wireless Duocast Relay Multiple Access Channels in the Low Power Regime Bai Ro, Tomohiko Uyematsu, Ryutaroh Matsumoto, Tetsunao Matsuta (Tokyo Inst. of Tech.) IT2013-81 ISEC2013-110 WBS2013-70 |
This paper deals with the energy effiency of energy-constrained terminals in the wireless duocast relay multiple access ... [more] | IT2013-81 ISEC2013-110 WBS2013-70 pp.169-174 |
| ISEC, IT, WBS | 2014-03-11 15:15 |
Aichi | Nagoya Univ., Higashiyama Campus | Identification Capacity of a Biometrical Identification System Using List Decording Marika Mori, Tetsunao Matsuta, Ryutaroh Matsumoto, Tomohiko Uyematsu (Tokyo Inst. of Tech.) IT2013-93 ISEC2013-122 WBS2013-82 |
The biometrical identification system using list decorder is a system which outputs candidates from the observed biometr... [more] | IT2013-93 ISEC2013-122 WBS2013-82 pp.249-254 |
| 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, 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 |
| IT, ISEC, WBS | 2013-03-07 11:45 |
Osaka | Kwansei Gakuin Univ., Osaka-Umeda Campus | Order Estimator of Stationary Markov Sources Using Codeword Length of Universal Code Shinji Kanazawa, Tomohiko Uyematsu (Tokyo Inst. of Tech.) IT2012-65 ISEC2012-83 WBS2012-51 |
Merhav et al. studied the problem of estimating the order of stationary Markov sources. They proposed an order estimator... [more] | IT2012-65 ISEC2012-83 WBS2012-51 pp.19-24 |
| IT | 2013-01-21 10:30 |
Tokyo | Univ. of Electro-Communications | Diversity Multiplexing Trade-off over Two-Way Relay Channel Atsushi Sugai, Ryutaroh Matsumoto, Tomohiko Uyematsu (Titech) IT2012-49 |
A two-way relay channel is a channel in which one source node communicates with another source node through a relay node... [more] | IT2012-49 pp.1-6 |
| 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, ISEC, WBS | 2012-03-01 10:30 |
Kanagawa | Wyner-Ziv video coding with a quantizer using correlations between frames Michiaki Ohkawa, Tomohiko Uyematsu, Ryutaroh Matsumoto (Tokyo Tech) IT2011-56 ISEC2011-83 WBS2011-57 |
Wyner-Ziv video coding is a video coding using information from neighbor frames at decoding with exploiting the correlat... [more] | IT2011-56 ISEC2011-83 WBS2011-57 pp.67-72 |
|
| IT, ISEC, WBS | 2012-03-01 17:00 |
Kanagawa | Error Exponents of Linear Codes for Slepian-Wolf Source Coding Tomohiko Uyematsu (Tokyo Inst. Tech.) IT2011-55 ISEC2011-82 WBS2011-56 |
The Slepian-Wolf coding problem is one of the most fundamental problems in the area of multiterminal source coding. In ... [more] |
IT2011-55 ISEC2011-82 WBS2011-56 pp.61-66 |
|
| IT, ISEC, WBS | 2012-03-02 13:25 |
Kanagawa | [Invited Talk]
Information Theoretically Secure Secret Key Agreement Shun Watanabe (Univ. Tokushima), Ryutaroh Matsumoto, Tomohiko Uyematsu (TITECH) IT2011-73 ISEC2011-100 WBS2011-74 |
(To be available after the conference date) [more] | IT2011-73 ISEC2011-100 WBS2011-74 pp.171-179 |
|
| IT | 2011-07-22 09:30 |
Okayama | Okayama University | Strongly-Secure Secret Sharing based on Linear Codes Can Be Characterized by Generalized Hamming Weight Jun Kurihara (Tokyo Inst. of Tech./KDDI R&D Labs), Tomohiko Uyematsu (Tokyo Inst. of Tech.) IT2011-16 |
[more] | IT2011-16 pp.35-40 |
| IT | 2011-07-22 13:25 |
Okayama | Okayama University | A Method for Generating Two Independent Random Sequences by Independent Mappings for Two Correlated Sources Shohei Kunimatsu, Tomohiko Uyematsu, Ryutaroh Matsumoto (Tokyo Tech) IT2011-21 |
Muramatsu et al. studied the problem of generating two independent random numbers by two independent mappings for two co... [more] | IT2011-21 pp.65-70 |
| 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 | 2011-01-18 13:20 |
Nara | Reliability functions of fixed-length source coding with list decoder Kenyu Shimono, Tomohiko Uyematsu, Ryutaroh Matsumoto (Tokyo Tech.) IT2010-59 |
(To be available after the conference date) [more] | IT2010-59 pp.31-36 |
|
| IT | 2011-01-18 14:00 |
Nara | A general formula for the capacity region of multiple-access channels with feedback Tetsunao Matsuta, Tomohiko Uyematsu (Tokyo Inst. of Tech.) IT2010-61 |
Recently, the multi-terminal information theory becomes more important, because multi-terminal communication systems hav... [more] | IT2010-61 pp.43-48 |
|
| IT | 2011-01-18 15:40 |
Nara | Iterative Decoding of LDPC Codes with Convex Optimization and Min-Sum Decoding Tomoaki Oiki, Ryutaroh Matsumoto, Tomohiko Uyematsu (Tokyo Tech) IT2010-65 |
[more] | IT2010-65 pp.67-72 |
|
| 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 10:15 |
Nagano | Nagano-Engineering Campus, Shinshu University | Joint channel estimation and LDPC decoding over MIMO channels by nonlinear optimization Takefumi Kobayashi, Ryutaroh Matsumoto, Tomohiko Uyematsu (Tokyo Inst. of Tech.) IT2009-92 ISEC2009-100 WBS2009-71 |
In wireless communication systems, a training sequence is often used to obtain the channel state information (CSI) and i... [more] | IT2009-92 ISEC2009-100 WBS2009-71 pp.135-140 |
| IT, ISEC, WBS | 2010-03-04 16:35 |
Nagano | Nagano-Engineering Campus, Shinshu University | Universal Slepian-Wolf Source Codes Using Low-Density Parity-Check Matrices Tetsunao Matsuta, Tomohiko Uyematsu, Ryutaroh Matsumoto (Tokyo Inst. of Tech.) IT2009-99 ISEC2009-107 WBS2009-78 |
Low-density parity-check (LDPC) codes become very popular in channel coding, since they can achieve the performance clos... [more] | IT2009-99 ISEC2009-107 WBS2009-78 pp.181-186 |
[Return to Top Page]