| Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
| IT |
2005-07-21
13:30 |
Osaka |
Osaka Prefecture Univ. |
[Invited Talk]
Recent Attacks on Symmetric ciphers
Toshinobu Kaneko (Tokyo Univ. of Science) |
CRYPTREC list, which is the e-government recommended ciphers list, was published in February 2003, There are 31 cryptogr... [more] |
IT2005-36
pp.1-8 |
| IT |
2005-07-21
14:45 |
Osaka |
Osaka Prefecture Univ. |
A Decoding Algorithm for q-ary Turbo Codes by Deleting Trellis Branches
Yu Hasegawa, Gou Hosoya, Hideki Yagi, Shigeichi Hirasawa (Waseda Univ.) |
[more] |
IT2005-37
pp.9-14 |
| IT |
2005-07-21
15:10 |
Osaka |
Osaka Prefecture Univ. |
Comparison of efficiency of Grover algorithm and AS algorithm when phase-error is cosidered
Hiroshi Nishikawa, Satoshi Iriyama, Masanori Ohya (TUS) |
Many studies on the quantum computation have been done in the world for this decade, and various quantum algorithms are ... [more] |
IT2005-38
pp.15-18 |
| IT |
2005-07-21
15:35 |
Osaka |
Osaka Prefecture Univ. |
On efficiency of information transmission for quantum-classical communication processes with quantum control process
Seiichi Hayano, Noboru Watanabe (TUS) |
(To be available after the conference date) [more] |
IT2005-39
pp.19-24 |
| IT |
2005-07-21
16:00 |
Osaka |
Osaka Prefecture Univ. |
On error probability of four beam splitter gate using the mutually orthogonal state of quantum
Toshiyuki Yamanaka, Noboru Watanabe (Tokyo Science Univ.) |
(To be available after the conference date) [more] |
IT2005-40
pp.25-29 |
| IT |
2005-07-22
10:00 |
Osaka |
Osaka Prefecture Univ. |
A construction method of best punctured convolutional codes
Yuuki Ogami, Hiroshi Sasano, Takuya Nishimura (Kinki Univ.) |
This paper deal with the construction of best punctured convolutional codes.
In general, the best code is constructed b... [more] |
IT2005-41
pp.1-5 |
| IT |
2005-07-22
10:25 |
Osaka |
Osaka Prefecture Univ. |
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.) |
[more] |
IT2005-42
pp.7-8 |
| IT |
2005-07-22
10:50 |
Osaka |
Osaka Prefecture Univ. |
Construction Antidictionary of a Binary String Using Suffix Tree
Takahiro Ota (PIT Nagano), Hiroyoshi Morita (UEC) |
An antidictionary is a set of shortest words that never appear in a binary string. To construct the antidictionary for a... [more] |
IT2005-43
pp.9-14 |
| IT |
2005-07-22
11:15 |
Osaka |
Osaka Prefecture Univ. |
Least Upper Bound of Family Number of N-Shift Othgonal Sequences
Naoki Suehiro, Chenggao Han (Univ. of Tsukuba) |
[more] |
IT2005-44
pp.15-17 |
| IT |
2005-07-22
13:00 |
Osaka |
Osaka Prefecture Univ. |
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) |
[more] |
IT2005-45
pp.19-23 |
| IT |
2005-07-22
13:25 |
Osaka |
Osaka Prefecture Univ. |
Comparison of Genomes in Immunodeficiency Virus by Entropic Chaos Degree
Takashi Hitani, Keiko Sato, Masanori Ohya (TUS) |
It is important to take various techniques and results obtained in Information Theory to analyze various aspects of life... [more] |
IT2005-46
pp.25-28 |
| IT |
2005-07-22
13:50 |
Osaka |
Osaka Prefecture Univ. |
A Study of Calculating Information Hiding Capacity of Digital Watermarking
Kensuke Yasui, Tota Suko, Toshiyasu Matsushima (Waseda Univ.) |
Digital watermarking is one of the techniques to protect copyright ownership of digital contents such as images, audio, ... [more] |
IT2005-47
pp.29-34 |
| IT |
2005-07-22
14:30 |
Osaka |
Osaka Prefecture Univ. |
A PPM* algorithm using context mixture
Hiroyuki Anase, Kazuhiro Keshi, Takashi Ishida, Shigeichi Hirasawa (Waseda Univ.) |
[more] |
IT2005-48
pp.35-40 |
| IT |
2005-07-22
14:55 |
Osaka |
Osaka Prefecture Univ. |
Data Compression by Arithmetic Coding and Source Modeling based on the Anti-Dictionary Method
Noriyuki Ohkawa, Kunihiko Harada, Hirosuke Yamamoto (Univ. of Tokyo) |
Generally, the anti-dictionary method can't archive high compression rate except the case that a data sequence can be mo... [more] |
IT2005-49
pp.41-46 |
| IT |
2005-07-22
15:20 |
Osaka |
Osaka Prefecture Univ. |
An Algorithm of Bayes Coding for FSMX Sources to Reduce Required Memory Size
Akira Nakano, Naoto Kobayashi, Toshiyasu Matsushima (Waseda Univ.) |
Bayes code is one of universal source codings, such that a class of the probabilistic model of source is known but the p... [more] |
IT2005-50
pp.47-52 |