Fri, May 16 AM 09:50 - 11:05 |
(1) |
09:50-10:15 |
Efficiency Tricks for Hashing and Blooming in Streaming Algorithms |
Marat Zhanikeev (Kyushu Inst. of Tech.) |
(2) |
10:15-10:40 |
Flash Code with Block Deflation and Discrete Cell-Levels |
Michael Joseph Tan, Yuichi Kaji (NAIST) |
(3) |
10:40-11:05 |
Derivation of the memory capacity necessary for MBQC by using the quantum one-time pad |
Tomoyuki Morimae (Gunma Univ.) |
|
11:05-11:15 |
Break ( 10 min. ) |
Fri, May 16 AM 11:15 - 12:05 |
(4) |
11:15-11:40 |
A Note on Relationship between Program Readability and the T-Complexity in Java Language |
Keiichi Takahashi, Takayasu Kaida (Kinki Univ.) |
(5) |
11:40-12:05 |
A Portrait of Claude E. Shannon
-- Based on various documents written by people who directly communicated with him -- |
Kimiaki Tokumaru (System Engineer) |
|
12:05-13:25 |
Lunch Break ( 80 min. ) |
Fri, May 16 PM 13:25 - 14:40 |
(6) |
13:25-13:50 |
A method of parallel processing of syndromes to decode primitive BCH codes |
Ken-ichi Iwata, Reiya Ooshima (Univ. of Fukui) |
(7) |
13:50-14:15 |
A Lower Bound on Asymptotic Distance Ratio of Product Codes and Constructive Asymptotically Good Product Codes |
Toshihisa Nishijima (Hosei Univ.), Kin-ichiroh Tokiwa (Osaka Sangyo Univ.) |
(8) |
14:15-14:40 |
Error Probability Performance of Spinal Codes under the Condition of Fixed Rate |
Hodaka Tashiro (Osaka City Univ.), Yu Morishima (SNCT), Ikuo Oka, Shingo Ata (Osaka City Univ.) |
Fri, May 16 PM 14:40 - 16:05 |
|
14:40-14:50 |
Break ( 10 min. ) |
(9) |
14:50-15:15 |
Iterative Channel Estimation and Decoding via Spatial Coupling |
Shuhei Horio, Keigo Takeuchi (UEC) |
(10) |
15:15-15:40 |
A Necessary Condition for Universally Achieving the Capacity with Spatially-Coupled Hsu-Anastasopoulos Fountain Codes |
Yuki Igarashi, Kenta Kasai, Kohichi Sakaniwa (Tokyo Inst. of Tech.) |
(11) |
15:40-16:05 |
Performance Evaluation of Sparse Superposition Codes by Numerical Experiments |
Kohei Miyamoto, Misato Takaki, Masanori Kawakita, Jun'ichi Takeuchi (Kyushu Univ.) |