Conference Date |
Thu, Jul 21, 2005 13:30 - 16:25
Fri, Jul 22, 2005 10:00 - 15:45 |
Topics |
fresshman session, general |
Conference Place |
Library and Science Information Center, Osaka Prefecture University |
Address |
1-1 Gakuen-cho, Sakai, Osaka 599-8531 Japan |
Transportation Guide |
http://www.osakafu-u.ac.jp/english/other/access/index.html |
Contact Person |
Prof. Akira Shiozaki
072-254-9280 |
Sponsors |
This conference is co-sponsored by the IEEE IT Society Japan Chapter
|
Announcement |
Please join us for an opening reception. |
Thu, Jul 21 PM Invited Talk 13:30 - 14:30 |
(1) |
13:30-14:30 |
[Invited Talk]
Recent Attacks on Symmetric ciphers |
Toshinobu Kaneko (Tokyo Univ. of Science) |
|
14:30-14:45 |
Break ( 15 min. ) |
Thu, Jul 21 PM Freshman Session 14:45 - 16:25 |
(2) |
14:45-15:10 |
A Decoding Algorithm for q-ary Turbo Codes by Deleting Trellis Branches |
Yu Hasegawa, Gou Hosoya, Hideki Yagi, Shigeichi Hirasawa (Waseda Univ.) |
(3) |
15:10-15:35 |
Comparison of efficiency of Grover algorithm and AS algorithm when phase-error is cosidered |
Hiroshi Nishikawa, Satoshi Iriyama, Masanori Ohya (TUS) |
(4) |
15:35-16:00 |
On efficiency of information transmission for quantum-classical communication processes with quantum control process |
Seiichi Hayano, Noboru Watanabe (TUS) |
(5) |
16:00-16:25 |
On error probability of four beam splitter gate using the mutually orthogonal state of quantum |
Toshiyuki Yamanaka, Noboru Watanabe (Tokyo Science Univ.) |
Fri, Jul 22 AM General Session 10:00 - 11:40 |
(6) |
10:00-10:25 |
A construction method of best punctured convolutional codes |
Yuuki Ogami, Hiroshi Sasano, Takuya Nishimura (Kinki Univ.) |
(7) |
10:25-10:50 |
An Improved Decoding Algorithm That Can Correct More Than Three Random Errors for The Constant Weight Codes Defined by Discrete Groups |
Jun Imai (NTT Communication Science Labs.), Yoshinao Shiraki (Shonan Inst. of Tech.) |
(8) |
10:50-11:15 |
Construction Antidictionary of a Binary String Using Suffix Tree |
Takahiro Ota (PIT Nagano), Hiroyoshi Morita (UEC) |
(9) |
11:15-11:40 |
Least Upper Bound of Family Number of N-Shift Othgonal Sequences |
Naoki Suehiro, Chenggao Han (Univ. of Tsukuba) |
Fri, Jul 22 PM Freshman Session 13:00 - 15:45 |
(10) |
13:00-13:25 |
Proposition of the alignment of the amino acid array which considers the base mutation of the configuration codon |
Toshihide Hara, Keiko Sato, Masanori Ohya (TUS) |
(11) |
13:25-13:50 |
Comparison of Genomes in Immunodeficiency Virus by Entropic Chaos Degree |
Takashi Hitani, Keiko Sato, Masanori Ohya (TUS) |
(12) |
13:50-14:15 |
A Study of Calculating Information Hiding Capacity of Digital Watermarking |
Kensuke Yasui, Tota Suko, Toshiyasu Matsushima (Waseda Univ.) |
|
14:15-14:30 |
Break ( 15 min. ) |
(13) |
14:30-14:55 |
A PPM* algorithm using context mixture |
Hiroyuki Anase, Kazuhiro Keshi, Takashi Ishida, Shigeichi Hirasawa (Waseda Univ.) |
(14) |
14:55-15:20 |
Data Compression by Arithmetic Coding and Source Modeling based on the Anti-Dictionary Method |
Noriyuki Ohkawa, Kunihiko Harada, Hirosuke Yamamoto (Univ. of Tokyo) |
(15) |
15:20-15:45 |
An Algorithm of Bayes Coding for FSMX Sources to Reduce Required Memory Size |
Akira Nakano, Naoto Kobayashi, Toshiyasu Matsushima (Waseda Univ.) |