|
|
| Chair |
|
Jun-ichi Takeuchi (Kyushu Univ.) |
| Vice Chair |
|
Yasutada Oohama (Univ. of Electro-Comm.) |
| Secretary |
|
Ryo Nomura (Senshu Univ.), Takuya Kusaka (Okayama Univ.) |
| Assistant |
|
Motohiko Isaka (Kwansei Gakuin Univ.) |
|
| Conference Date |
Fri, May 16, 2014 09:50 - 16:05 |
| Topics |
general |
| Conference Place |
Beppu International Convention Center |
| Address |
Yamanote-machi 12-1, Beppu-shi, Ooita, 874-0828 Japan |
| Transportation Guide |
15min. by walk or 5min. by Bus from JR Beppu Station
http://www.b-conplaza.jp/english/index.htm |
Contact
Person |
Prof. Yutaka Jitsumatsu, Kyushu Univ.
+81-92-802-3624 |
| Sponsors |
This conference is co-sponsored by IEEE IT Society Japan Chapter.
|
Copyright
and
reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
Fri, May 16 AM
09:50 - 11:05 |
| (1) |
09:50-10:15 |
Efficiency Tricks for Hashing and Blooming in Streaming Algorithms  IT2014-1 |
Marat Zhanikeev (Kyushu Inst. of Tech.) |
| (2) |
10:15-10:40 |
Flash Code with Block Deflation and Discrete Cell-Levels IT2014-2 |
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 IT2014-3 |
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 -- IT2014-4 |
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 IT2014-5 |
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 IT2014-6 |
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 IT2014-7 |
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 IT2014-8 |
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 IT2014-9 |
Yuki Igarashi, Kenta Kasai, Kohichi Sakaniwa (Tokyo Inst. of Tech.) |
| (11) |
15:40-16:05 |
Performance Evaluation of Sparse Superposition Codes by Numerical Experiments IT2014-10 |
Kohei Miyamoto, Misato Takaki, Masanori Kawakita, Jun'ichi Takeuchi (Kyushu Univ.) |
| Announcement for Speakers |
| General Talk | Each speech will have 20 minutes for presentation and 5 minutes for discussion. |
| Contact Address and Latest Schedule Information |
| IT |
Technical Committee on Information Theory (IT) [Latest Schedule]
|
| Contact Address |
E- :it- c  (to IT Secretaries)
.
Ryo Nomura (Senshu University)
Takuya Kusaka (Okayama University)
Motohiko Isaka (Kwansei Gakuin University) |
Last modified: 2014-05-13 11:47:43
|