| 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 | 2009-09-30 13:00 |
Tokyo | Sophia Univ. | [Invited Talk]
Problems in application of LDPC codes to information reconciliation in quantum key distribution protocols Ryutaroh Matsumoto (Tokyo Inst. of Tech.)  IT2009-41 |
The information reconciliation in a quantum key distribution protocol can be studied separately from other steps in the... [more] |
IT2009-41 pp.49-52 |
| WBS, IT, ISEC | 2009-03-09 16:20 |
Hokkaido | Hakodate Mirai Univ. | Relationship among Conditional Complexities of Individual Sequences Yuki Tanaka, Tomohiko Uyematsu, Ryutaroh Matsumoto (Tokyo Inst. of Tech.) IT2008-64 ISEC2008-122 WBS2008-77 |
Conditional complexities of individual sequences are known as lower bounds on the compression rate attainable by some cl... [more] | IT2008-64 ISEC2008-122 WBS2008-77 pp.129-136 |
| WBS, IT, ISEC | 2009-03-10 09:00 |
Hokkaido | Hakodate Mirai Univ. | A proof of universality of the source coding by most frequent match Yangao Lin, Tomohiko Uyematsu, Ryutaroh Matsumoto (Tokyo Inst. of Tech.) IT2008-96 ISEC2008-154 WBS2008-109 |
In the grammar based code proposed by Kieffer and Yang, for a given data string, we first produce a context-free grammar... [more] | IT2008-96 ISEC2008-154 WBS2008-109 pp.343-348 |
| WBS, IT, ISEC | 2009-03-10 09:50 |
Hokkaido | Hakodate Mirai Univ. | Universal Lossless Source Coding Based on Sequential Grammar Transforms Masaki Jono, Tomohiko Uyematsu, Ryutaroh Matsumoto (Tokyo Inst. of Tech.) IT2008-98 ISEC2008-156 WBS2008-111 |
The grammar-based code proposed by Kieffer and Yang is a large class of universal codes. Usually, the grammar-based cod... [more] |
IT2008-98 ISEC2008-156 WBS2008-111 pp.355-362 |
| WBS, IT, ISEC | 2009-03-10 10:50 |
Hokkaido | Hakodate Mirai Univ. | Closed Forms of the Achievable Rate Region for Wyner's Source Coding Systems Tetsunao Matsuta, Tomohiko Uyematsu, Ryutaroh Matsumoto (Tokyo Inst. of Tech.) IT2008-100 ISEC2008-158 WBS2008-113 |
Wyner's source coding system is one of the most fundamental fixed-length source coding systems with side information ava... [more] | IT2008-100 ISEC2008-158 WBS2008-113 pp.371-378 |
| WBS, IT, ISEC | 2009-03-10 11:15 |
Hokkaido | Hakodate Mirai Univ. | Error Exponents for Wyner's Source Coding System Tetsunao Matsuta, Shun Watanabe, Tomohiko Uyematsu, Ryutaroh Matsumoto (Tokyo Inst. of Tech.) IT2008-101 ISEC2008-159 WBS2008-114 |
Wyner's source coding system is one of the most fundamental fixed-length source coding systems with side information. T... [more] |
IT2008-101 ISEC2008-159 WBS2008-114 pp.379-385 |
| WBS, IT, ISEC | 2009-03-10 11:40 |
Hokkaido | Hakodate Mirai Univ. | On the Admissible Rate Region of Slepian-Wolf Coding Problem with LDPC Code and Mismatched Decoder Kazuhiro Yamasaki, Ryutaroh Matsumoto, Tomohiko Uyematsu (Tokyo Inst. of Tech.) IT2008-102 ISEC2008-160 WBS2008-115 |
Recently, the application of the {\it low density parity check} (LDPC) codes to Slepian-Wolf source coding problem is st... [more] | IT2008-102 ISEC2008-160 WBS2008-115 pp.387-393 |
| WBS, IT, ISEC | 2009-03-10 13:00 |
Hokkaido | Hakodate Mirai Univ. | Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code Shun Watanabe, Tsuki Saitou, Ryutaroh Matsumoto, Tomohiko Uyematsu (Tokyo Inst. of Tech.) IT2008-103 ISEC2008-161 WBS2008-116 |
The privacy amplification is a technique to distill a secret key from a random variable by a function so that the dist... [more] |
IT2008-103 ISEC2008-161 WBS2008-116 pp.395-400 |
| WBS, IT, ISEC | 2009-03-10 13:25 |
Hokkaido | Hakodate Mirai Univ. | Optimal Axis Compensation in Quantum Key Distribution Protocols Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu (Tokyo Inst. of Tech.) IT2008-104 ISEC2008-162 WBS2008-117 |
We show the optimal axis compensations maximizing the key generation rate for unital channels. We consider the case ... [more] |
IT2008-104 ISEC2008-162 WBS2008-117 pp.401-407 |
| IT | 2008-07-24 10:55 |
Chiba | University of Tokyo, Kashiwa Campus | Network coding for time-varying delay. Terumasa Tateno, Ryutaroh Matsumoto, Tomohiko Uyematsu (Tokyo Tech) IT2008-8 |
In the research of the network coding, it was assumed that there is constant delay that does not change in time or that ... [more] | IT2008-8 pp.1-6 |
| ISEC, IT, WBS | 2008-02-28 10:45 |
Tokyo | Secret key can be obtained from both compatible and incompatible measurements in the six-state QKD protocol Ryutaroh Matsumoto (Tokyo Inst. of Tech.) IT2007-43 ISEC2007-140 WBS2007-74 |
We give an example of a quantum channel over which the six-state quantum key distribution protocol allows the legitima... [more] |
IT2007-43 ISEC2007-140 WBS2007-74 pp.73-75 |
|
| ISEC, IT, WBS | 2008-02-29 10:45 |
Tokyo | Secret Key Agreement by Reliability Information of Signals in Gaussian Maurer's Model Masashi Naito, Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu (Tokyo Inst. of Tech.) IT2007-54 ISEC2007-151 WBS2007-85 |
We consider the problem of secret key agreement in Gaussian Maurer’s Model. In Gaussian Maurer's model, legitimate rece... [more] |
IT2007-54 ISEC2007-151 WBS2007-85 pp.37-41 |
|
| ISEC, IT, WBS | 2008-02-29 13:50 |
Tokyo | Network Error-Correcting Codes for Network with Delay Yoshito Yamada, Ryutaroh Matsumoto, Tomohiko Uyematsu (Tokyo Tech) IT2007-69 ISEC2007-166 WBS2007-100 |
We propose two algorithms for constructing network error-correcting codes on a network with delays. One algorithm can co... [more] | IT2007-69 ISEC2007-166 WBS2007-100 pp.133-140 |
|
| ISEC, IT, WBS | 2008-02-29 14:55 |
Tokyo | Near ML detection using Dijkstra's algorithm with bounded list size over MIMO channels Atsushi Okawado, Ryutaroh Matsumoto, Tomohiko Uyematsu (Tokyo Inst. of Tech.) IT2007-70 ISEC2007-167 WBS2007-101 |
We propose Dijkstra's algorithm with bounded list size after QR decomposition for decreasing the computational compl... [more] |
IT2007-70 ISEC2007-167 WBS2007-101 pp.141-146 |
|
| IT | 2008-01-17 16:15 |
Tokyo | Waseda Univ. | Key rate Available from Incompatible Mesurements in the BB84 Protocol and the Uncertainty Principle Ryutaroh Matsumoto, Shun Watanabe (Tokyo Inst. of Tech.) IT2007-30 |
We evaluate the amount of secret key that can be obtained from the incompatible measurements in the BB84 quantum key d... [more] |
IT2007-30 pp.31-34 |
| IT | 2007-07-19 16:05 |
Hyogo | Kobe Univ. | MIMO-MLC Communication System with Large Outage Capacity Shouta Iwazaki, Ryutaroh Matsumoto, Tomohiko Uyematsu (Tokyo Inst. Tech.) IT2007-14 |
Multilevel coding (MLC) allows us to use binary error-correcting codes with multilevel modulation. Since an MIMO commu... [more] |
IT2007-14 pp.31-36 |
| IT | 2007-01-30 15:35 |
Osaka | Osaka Electro-Communication University | Construction algorithm for optimal network error-correcting codes Ryutaroh Matsumoto (Tokyo Inst.of Tech.) |
We give an algorithm for constructing linear network error-correcting codes that achieve the Singleton bound for network... [more] | IT2006-57 pp.41-45 |
| RCS, SIP (Joint) |
2006-01-26 17:20 |
Fukuoka | Kyusyu Univ. | Performance improvement of lossless audio compression by using cascaded adaptive prediction filters Makio Tsuchiyama, Tomohiko Uyematsu, Ryutaroh Matsumoto (Tokyo Tech) |
Lossless compression for audio data consists of signal prediction and an entropy coder, and signal prediction consists ... [more] | SIP2005-134 pp.23-28 |
| IE, CS | 2005-12-12 16:40 |
Aichi | Nagoya Univ. (Video Conf.) | Efficient Nonbinary Coding Systems Approaching the Shannon Limit by using Product Accumulate Codes Jun Kurihara, Tomohiko Uyematsu, Ryutaroh Matsumoto (Tokyo Tech) |
PA (Product Accumulate) codes achieve perfomance near the Shannon limit for BPSK, have low encoding and decoding complex... [more] | CS2005-60 IE2005-115 pp.45-50 |
| RCS | 2004-08-27 14:00 |
Hokkaido | Hokkaido University | Maximum mutual information of space-time block codes with symbolwise decodability Kenji Tanaka, Ryutaroh Matsumoto, Tomohiko Uyematsu (Tokyo Inst. of Tech.) |
In this paper, we analyze the performance of space-time block codes which enable symbolwise maximum likelihood decoding.... [more] | RCS2004-147 pp.67-72 |
[Return to Top Page]