| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Information Theory (IT) (Searched in: 2007)
Search Results: Keywords 'from:2008-02-28 to:2008-02-28'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| ISEC, IT, WBS | 2008-02-29 10:20 |
Tokyo | A Construction of Channel Code, Joint Source-Channel Code, and Universal Code for Arbitrary Stationary Memoryless Channels using Sparse Matrices Shigeki Miyake, Jun Muramatsu (NTT)  IT2007-53 ISEC2007-150 WBS2007-84 |
A channel code is constructed using sparse matrices for stationary memoryless channels that do not necessarily have a s... [more] |
IT2007-53 ISEC2007-150 WBS2007-84 pp.29-36 |
|
| ISEC, IT, WBS | 2008-02-29 10:45 |
Tokyo | Secret Key Agreement by Reliability Information of Signals in Gaussian Maurer's Model Masashi Naito, Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu (Tokyo Inst. of Tech.) IT2007-54 ISEC2007-151 WBS2007-85 |
We consider the problem of secret key agreement in Gaussian Maurer’s Model. In Gaussian Maurer's model, legitimate rece... [more] |
IT2007-54 ISEC2007-151 WBS2007-85 pp.37-41 |
|
| ISEC, IT, WBS | 2008-02-29 11:10 |
Tokyo | Construction of Randomness Testing Based on T-Codes Kenji Hamano, Hirosuke Yamamoto (Tokyo Univ.) IT2007-55 ISEC2007-152 WBS2007-86 |
We propose a new randomness test based on T-Codes. T-Codes are variable-length self-synchronization codes introduced b... [more] |
IT2007-55 ISEC2007-152 WBS2007-86 pp.43-50 |
|
| ISEC, IT, WBS | 2008-02-29 11:35 |
Tokyo | A Lower Bound on the Number of Uncorrectable Errors of Weight Half the Minimum Distance Kenji Yasunaga, Toru Fujiwara (Osaka Univ.) IT2007-56 ISEC2007-153 WBS2007-87 |
[more] | IT2007-56 ISEC2007-153 WBS2007-87 pp.51-56 |
|
| ISEC, IT, WBS | 2008-02-29 13:00 |
Tokyo | New Classes of Public Key Cryptosystem Constructed on the Basis of Multivariate Polynomials and Random Coding
-- Another class of K(III)RSE(g)PKC -- Masao Kasahara (Osaka Gakuin Univ.) IT2007-57 ISEC2007-154 WBS2007-88 |
[more] | IT2007-57 ISEC2007-154 WBS2007-88 pp.57-64 |
|
| ISEC, IT, WBS | 2008-02-29 13:25 |
Tokyo | RC4 Keystream Generator (1) Imaya, Masahiro Sukegawa, Atsuko Miyaji (JAIST) IT2007-62 ISEC2007-159 WBS2007-93 |
Pseudo-Random Generation Algorithm(PRGA) on RC4 change at most two entry per round. If two PRGAs internal states are al... [more] |
IT2007-62 ISEC2007-159 WBS2007-93 pp.89-94 |
|
| ISEC, IT, WBS | 2008-02-29 13:50 |
Tokyo | New Weakness in Alleged RC4 Keystream Generator (2) Masahiro Sukegawa, Imaya, Atsuko Miyaji (JAIST) IT2007-63 ISEC2007-160 WBS2007-94 |
Pseudo-Random Generation Algorithm(PRGA) on RC4 change at most two entry per round. If two PRGAs internal states are al... [more] |
IT2007-63 ISEC2007-160 WBS2007-94 pp.95-100 |
|
| ISEC, IT, WBS | 2008-02-29 14:15 |
Tokyo | A proposal of modified multi ring signature Mitsuaki Ikeda, Yutaka Kawai, Kazuo Ohta (UEC) IT2007-58 ISEC2007-155 WBS2007-89 |
The $k$-out-of-$n$ signature is a signature scheme where $k$ real signers among $n$ signers corporate in signature gene... [more] |
IT2007-58 ISEC2007-155 WBS2007-89 pp.65-71 |
|
| ISEC, IT, WBS | 2008-02-29 14:55 |
Tokyo | A Construction of Partially Blind Signatures with Traceability Tsunemichi Chiba (Mitsubishi Electric CC), Eikoh Chida (Ichinoseki NCT), Masahiro Mambo (Univ. of Tsukuba), Hiroki Shizuya (Tohoku Univ.) IT2007-59 ISEC2007-156 WBS2007-90 |
In the paper we propose a construction of partially blind signatures with traceability. The proposed scheme has two ve... [more] |
IT2007-59 ISEC2007-156 WBS2007-90 pp.73-78 |
|
| ISEC, IT, WBS | 2008-02-29 15:20 |
Tokyo | Quantum Secret Sharing Scheme for Amplitude Information Takeshi Okada, Hidenori Kuwakado, Masakatu Morii (Kobe Univ.) IT2007-60 ISEC2007-157 WBS2007-91 |
Since the quantum secret sharing scheme proposed by Hillery, $\mathrm{Bu\check{z}ek}$, and Berthiaume leaks amplitude in... [more] | IT2007-60 ISEC2007-157 WBS2007-91 pp.79-82 |
|
| ISEC, IT, WBS | 2008-02-29 15:45 |
Tokyo | a digital watermarking and its new decoding method with LDPC codes, having clipping tolorance
-- an application of cyclic LDPC codes and decoding using detailed reliability information -- Isao Abe, Raul Martinez-Noriega, Hyunho Kang, Brian Kurkoski, Kazuhiko Yamaguchi (UEC) IT2007-61 ISEC2007-158 WBS2007-92 |
One of the important requirements for digital watermarking is robustness against clipping attacks. Especially for audi... [more] |
IT2007-61 ISEC2007-158 WBS2007-92 pp.83-88 |
|
| ISEC, IT, WBS | 2008-02-29 10:45 |
Tokyo | Investigation on Suitable Code Parameters for Wavelength-Hopping Time-Spreading Optical CDMA Systems Using Generalized MPSCs and Optical Orthogonal Codes Tomoko K. Matsushima (Polytechnic Univ.), Noboru Ochiai (Ibaraki Pref. Academy of Industrial Tech.), Takeshi Nagao (Sansou Systems), Yasuaki Teramachi (Polytechnic Univ.) IT2007-64 ISEC2007-161 WBS2007-95 |
There are only two free parameters such as length and weight of time-spreading codes to compose codes for two dimensiona... [more] | IT2007-64 ISEC2007-161 WBS2007-95 pp.101-108 |
|
| ISEC, IT, WBS | 2008-02-29 11:10 |
Tokyo | Atmospheric optical multi-level PPM with two PN codes Yusuke Kozawa, Hiromasa Habuchi (Ibaraki Univ.) IT2007-65 ISEC2007-162 WBS2007-96 |
In this paper, atmospheric optical multi-level pulse position modulation(PPM) with two modified pseudo orthogonal m-seq... [more] |
IT2007-65 ISEC2007-162 WBS2007-96 pp.109-114 |
|
| ISEC, IT, WBS | 2008-02-29 11:35 |
Tokyo | A Study of Multiuser Space-Frequency Codes for OFDMA Tatsumi Konishi (Aichi Inst. of Tech.) IT2007-66 ISEC2007-163 WBS2007-97 |
In this paper, we investigate the performance of multi-user MIMO-OFDM systems using the space-frequency codes for single... [more] | IT2007-66 ISEC2007-163 WBS2007-97 pp.115-119 |
|
| ISEC, IT, WBS | 2008-02-29 13:00 |
Tokyo | Generalized Lengthened Codes and its Applications Yasuo Asakura, Masakatu Morii (Kobe Univ.) IT2007-67 ISEC2007-164 WBS2007-98 |
It is important for coding theory to construct error correcting codes having superior performance. In this paper, we stu... [more] | IT2007-67 ISEC2007-164 WBS2007-98 pp.121-126 |
|
| ISEC, IT, WBS | 2008-02-29 13:25 |
Tokyo | Sliding Window Variation of Antidictionary Data Compression Takahiro Ota (PIT-nagano), Hiroyoshi Morita (UEC) IT2007-68 ISEC2007-165 WBS2007-99 |
An antidictionary is the set of all minimal strings that never appear in an input string, and efficient adaptive data co... [more] | IT2007-68 ISEC2007-165 WBS2007-99 pp.127-132 |
|
| ISEC, IT, WBS | 2008-02-29 13:50 |
Tokyo | Network Error-Correcting Codes for Network with Delay Yoshito Yamada, Ryutaroh Matsumoto, Tomohiko Uyematsu (Tokyo Tech) IT2007-69 ISEC2007-166 WBS2007-100 |
We propose two algorithms for constructing network error-correcting codes on a network with delays. One algorithm can co... [more] | IT2007-69 ISEC2007-166 WBS2007-100 pp.133-140 |
|
| ISEC, IT, WBS | 2008-02-29 14:15 |
Tokyo | Concentrating Entanglement by Random Measurement Hachiro Fujita (Tokyo Metro Univ.) IT2007-42 ISEC2007-139 WBS2007-73 |
[more] | IT2007-42 ISEC2007-139 WBS2007-73 pp.67-71 |
|
| ISEC, IT, WBS | 2008-02-29 14:55 |
Tokyo | Near ML detection using Dijkstra's algorithm with bounded list size over MIMO channels Atsushi Okawado, Ryutaroh Matsumoto, Tomohiko Uyematsu (Tokyo Inst. of Tech.) IT2007-70 ISEC2007-167 WBS2007-101 |
We propose Dijkstra's algorithm with bounded list size after QR decomposition for decreasing the computational compl... [more] |
IT2007-70 ISEC2007-167 WBS2007-101 pp.141-146 |
|
| ISEC, IT, WBS | 2008-02-29 15:20 |
Tokyo | A Study on Time Domain Block Equallizer on MIMO Frequency Selective Channels Yusuke Takahashi, Yasunori Iwanami, Eiji Okamoto (Nitech) IT2007-71 ISEC2007-168 WBS2007-102 |
We have proposed the novel block processing signal separation and equalization schemes in time domain on frequency selec... [more] | IT2007-71 ISEC2007-168 WBS2007-102 pp.147-152 |
|
[Return to Top Page]