Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
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 |
IT |
2008-07-24 11:20 |
Chiba |
University of Tokyo, Kashiwa Campus |
On Distance Distribution of a Reed-Solomon-like Code for Network Coding Masafumi Tominaga (Osaka Univ.), Kenji Yasunaga (Kwansei Gakuin Univ.), Toru Fujiwara (Osaka Univ.) IT2008-9 |
Network coding is a technique for efficient network communication. Middle nodes between a source node and a destination ... [more] |
IT2008-9 pp.7-10 |
IT |
2008-07-24 13:45 |
Chiba |
University of Tokyo, Kashiwa Campus |
Note on Efficiency of Information Transmission for Quantum Control Communication Process Toshiya Jitsukawa, Noboru Watanabe (TUS) IT2008-10 |
Since light is quantum object,it is necessary to treat the efficiency of information transmission based on the quantum m... [more] |
IT2008-10 pp.11-16 |
IT |
2008-07-24 14:10 |
Chiba |
University of Tokyo, Kashiwa Campus |
The classification of lineages by cytochrome P450 with the entropy evolution rate Nozomi Kimura, Toshihide Hara, Masanori Ohya (Tokyo Univ. of Science) IT2008-11 |
To classify organisms systematically, it’s important to measure the genetic distance between those organisms.
We study ... [more] |
IT2008-11 pp.17-20 |
IT |
2008-07-24 14:35 |
Chiba |
University of Tokyo, Kashiwa Campus |
A study of a diffusion phenomenon on coupled chaotic systems by chaos degree Chinatsu Arai, Satoshi Iriyama, Toshihiro Saito, Masanori Ohya (Tokyo Univ. of Science) IT2008-12 |
Information Dynamics(ID) is proposed by M.Ohya, and the chaos degree defined in ID is useful to analyze chaos phenomena.... [more] |
IT2008-12 pp.21-26 |
IT |
2008-07-24 15:15 |
Chiba |
University of Tokyo, Kashiwa Campus |
Source Coding with LDPC code using Linear Programming Junya Honda (Univ. of Tokyo), Shigeki Miyake (NTT), Hirosuke Yamamoto (Univ. of Tokyo), Mitsuru Maruyama (NTT) IT2008-13 |
In channel coding, Feldman showed that linear programming can be used instead of the sum-product algorithm in the decodi... [more] |
IT2008-13 pp.27-32 |
IT |
2008-07-24 15:40 |
Chiba |
University of Tokyo, Kashiwa Campus |
A usage of collusion-secure codes to enhance their trace back rates Yoshinobu Iriguchi, Kazuhiko Yamaguchi (UEC) IT2008-14 |
Collusion-secure codes are one of countermeasures against collusion attacks, a severe problem in digital fingerprinting.... [more] |
IT2008-14 pp.33-38 |
IT |
2008-07-24 16:20 |
Chiba |
University of Tokyo, Kashiwa Campus |
[Invited Talk]
Information Security Schemes in Wireless Communications Based on Radio Propagation Characteristics Hideichi Sasaoka (Doshisha Univ.) IT2008-15 |
As a countermeasure for the risk to eavesdrop by intercept a wireless communication, it is usual to apply the cryptograp... [more] |
IT2008-15 pp.39-44 |
IT |
2008-07-25 09:30 |
Chiba |
University of Tokyo, Kashiwa Campus |
On Some Properties of Complete Complementary Codes Yi Jin, Hiroki Koga (Tsukuba Univ.) IT2008-16 |
An $(M,N,L)$--complete complementary code, which contains $M$ sets of $N$ sequences of length $L$, can be considered as ... [more] |
IT2008-16 pp.1-6 |
IT |
2008-07-25 09:55 |
Chiba |
University of Tokyo, Kashiwa Campus |
(口頭発表)A Note on the Classical-Quantum Slepian-Wolf Problem Hachiro Fujita (Tokyo Metropolitan Univ.) |
[more] |
|
IT |
2008-07-25 10:20 |
Chiba |
University of Tokyo, Kashiwa Campus |
Concatenation of Quantum Error-Correcting Codes and Lower Bounds on the Largest Minimum Distance Mitsuru Hamada (Tamagawa Univ.) IT2008-17 |
[more] |
IT2008-17 pp.7-12 |
IT |
2008-07-25 10:50 |
Chiba |
University of Tokyo, Kashiwa Campus |
Delay of Symbols Obeying Poisson Arrival on Communication System by Arithmetic Code Mikihiko Nishiara (Shinshu Univ.), Tatsunori Sugihara (Toyoda Gosei) IT2008-18 |
We consider the delay of symbols that are obtained
from an i.i.d.\ source with the timing of Poisson arrival.
The code... [more] |
IT2008-18 pp.13-16 |
IT |
2008-07-25 11:15 |
Chiba |
University of Tokyo, Kashiwa Campus |
On Computing the Weight Distribution of High Rate Binary Cyclic Codes Yasuo Asakura (Kobe Univ.), Masami Mohri (Gifu Univ.), Masakatu Morii (Kobe Univ.) IT2008-19 |
The weight distribution is very important parameters which are necessary to evaluate the performance of the codes, and c... [more] |
IT2008-19 pp.17-22 |