Fri, May 21 AM Session 1
10:30 - 11:45 |
| (1) |
10:30-10:55 |
Associative memory in a neural network with uctuation |
Tohru Kohda, Yutaka Jitsumatsu, Naoto Maejima (Kyushu Univ.) |
| (2) |
10:55-11:20 |
Explicitly Constructive Concatenated Codes for Multiple Access Channels |
Hideki Yagi (Univ. of Electro-Comm.) |
| (3) |
11:20-11:45 |
Smooth Renyi Entropy and Intrinsic Randomness |
Tomohiko Uyematsu (Tokyo Inst. of Tech.) |
Fri, May 21 PM Session 2
13:45 - 15:25 |
| (4) |
13:45-14:10 |
Distributed Source Coding of Correlated Memoryless Gaussian Sources |
Yasutada Oohama (Univ. of Tokushima) |
| (5) |
14:10-14:35 |
Secret Key Agreement from Vector Gaussian Sources by Rate Limited Public Communication |
Shun Watanabe, Yasutada Oohama (Univ. of Tokushima) |
| (6) |
14:35-15:00 |
A Note on Bounds of Minimum Distance and Decoding Methods for Cyclic Codes by DFT Matrix |
Takayasu Kaida (Kinki Univ.), Junru Zheng (Kyushu Women's Univ.) |
| (7) |
15:00-15:25 |
Statistical Characteristics of Decision Variable for MAP Decoding |
Aki Kaizu, Ikuo Oka, Shingo Ata (Osaka City Univ.) |
Fri, May 21 PM Session 3
15:45 - 17:00 |
| (8) |
15:45-16:10 |
A Universal Decoding Scheme for Distributed Lossless Data Compression |
Shigeaki Kuzuoka (Wakayama Univ.) |
| (9) |
16:10-16:35 |
Universal Coding and Shannon-MacMillan-Breiman Theorem |
Joe Suzuki (Osaka Univ.) |
| (10) |
16:35-17:00 |
A generalization of Verdu-Han lemma with a distortion criterion |
Nobu Mori, Ken-ichi Iwata (Univ. of Fukui) |
:it-
c
(to IT Secretaries) 
c
be-u