Fri, Sep 19 AM
09:00 - 10:40 |
| (1) |
09:00-09:25 |
Fast Decoding Algorithm for Projective Reed-Muller Codes and Its Computational Complexity |
Norihiro Nakashima, Hajime Matsui (Toyota Tech. Inst.) |
| (2) |
09:25-09:50 |
On Decoding Method of Cyclic Codes over Symbol-Pair Read Channels |
Makoto Takita (Kobe Univ.), Masanori Hirotomo (Saga Univ.), Masakatu Morii (Kobe Univ.) |
| (3) |
09:50-10:15 |
On relations between DS2 bound and Sulman-Feder bound for Forney's Generalized Decoding |
Toshihiro Niinomi (Tokyo City Univ.), Hideki Yagi (UEC), Shigeichi Hirasawa (Waseda Univ.) |
| (4) |
10:15-10:40 |
A (k,n)-Threshold Scheme with Detectability of All the Cheaters Based on a Certain Majority Rule |
Noriaki Shimazaki, Hiroki Koga (Univ. of Tsukuba) |
| |
10:40-10:50 |
Break ( 10 min. ) |
Fri, Sep 19 AM
10:50 - 11:40 |
| (5) |
10:50-11:40 |
[Invited Talk]
Optimal Tracing Method for Fingerprinting Code |
Minoru Kuribayashi (Kobe Univ.) |
| |
11:40-13:00 |
Lunch ( 80 min. ) |
Fri, Sep 19 PM
13:00 - 14:40 |
| (6) |
13:00-13:25 |
Revisiting the Rate-Distortion Theory Using Smooth Max Renyi Divergence |
Tomohiko Uyematsu, Tetsunao Matsuta (Tokyo Inst. of Tech.) |
| (7) |
13:25-13:50 |
Algorithms for Generating Constrained Random Numbers and Their Application to Channel Coding |
Jun Muramatsu (NTT) |
| (8) |
13:50-14:15 |
Encoding of LDPC Codes via Block-Diagonalization |
Takayuki Nozaki (Kanagawa Univ.) |
| (9) |
14:15-14:40 |
Distance Properties of Non-Binary Convolutional Codes for M-QAM Coded Modulation |
Tatsumi Konishi, Yoshiki Komiyama, Kazunari Tsutsui (Aichi Inst. of Tech.) |
:it-
c
(to IT Secretaries)