| 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) |
2014-05-12 15:30 |
Aichi | Nagoya Univ. | Improved Asymptotic Key Rate of the B92 Protocol Ryutaroh Matsumoto (Tokyo Tech.) |
[more] | |
| 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-25 16:20 |
Tokyo | Nishi-Waseda campus, Waseda University | Gilbert-Varshamov-type Bound for Relative Dimension Length Profile Ryutaroh Matsumoto (Tokyo Inst. of Tech.) IT2013-18 |
We propose a Gilbert-Varshamov-type existential bound for the relative dimension length profile and the relative gener... [more] |
IT2013-18 pp.39-40 |
| 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 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, 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-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 |
|
| RCS, SAT (Joint) |
2011-08-25 14:35 |
Niigata | Niigata Univ. | [Requested Talk] Coding for Physical Layer Security Ryutaroh Matsumoto (Tokyo Tech.) SAT2011-25 RCS2011-120 |
[more] | SAT2011-25 RCS2011-120 pp.51-53 |
| 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 |
| ISEC, IT, WBS | 2011-03-04 13:25 |
Osaka | Osaka University | Secure Multiplex Coding with a Common Message Ryutaroh Matsumoto (Tokyo Inst. of Tech.), Masahito Hayashi (Tohoku Univ./NUS) IT2010-111 ISEC2010-115 WBS2010-90 |
We determine the capacity region of the secure multiplex coding with a common message, improve the exponent of mutual i... [more] |
IT2010-111 ISEC2010-115 WBS2010-90 pp.283-287 |
| 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 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, 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 |
| IT, ISEC, WBS | 2010-03-05 13:50 |
Nagano | Nagano-Engineering Campus, Shinshu University | Secure Key Rate of the BB84 Protocol using Finite Sample Bits Yousuke Sano, Ryutaroh Matsumoto, Tomohiko Uyematsu (Tokyo Inst. of Tech.) IT2009-138 ISEC2009-146 WBS2009-117 |
We improve the nonasymptotic key rate shown by Scarani and Renner by proposing several methods to construct tighter cons... [more] | IT2009-138 ISEC2009-146 WBS2009-117 pp.427-432 |
| IT, ISEC, WBS | 2010-03-05 14:15 |
Nagano | Nagano-Engineering Campus, Shinshu University | Bit Transmission Probability Maximizing the Key Rate of the BB84 Protocol Sonny Lumbantoruan, Ryutaroh Matsumoto, Tomohiko Uyematsu (Tokyo Inst. of Tech.) IT2009-139 ISEC2009-147 WBS2009-118 |
In all papers on the BB84 protocol, the transmission probability of each bit value is usually set to be equal. In this p... [more] | IT2009-139 ISEC2009-147 WBS2009-118 pp.433-438 |
| IT, ISEC, WBS | 2010-03-05 16:10 |
Nagano | Nagano-Engineering Campus, Shinshu University | Vulnerability of MRD-Code-based Universal Secure Network Coding against Stronger Eavesdroppers Eitaro Shioji, Ryutaroh Matsumoto, Tomohiko Uyematsu (Tokyo Inst. of Tech.) IT2009-143 ISEC2009-151 WBS2009-122 |
Silva et al. proposed a universal secure network coding scheme based on MRD codes, which can be applied to any underlyin... [more] | IT2009-143 ISEC2009-151 WBS2009-122 pp.455-460 |
| 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 |
[Return to Top Page]