| Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
| IT |
2004-09-16
13:30 |
Osaka |
Osaka Sangyo Univ. |
Error Performance of Modulation Classification by the Method of Moments
Go Fukuda, Ikuo Oka, Shingo Ata (Osaka City Univ), Chikato Fujiwara (Osaka Seikei Gakuin Univ.) |
In the current digital communications, the necessity over the adaptive or intelligent modulation systems corresponding ... [more] |
IT2004-31
pp.1-4 |
| IT |
2004-09-16
13:55 |
Osaka |
Osaka Sangyo Univ. |
A Loopback Retransmission Control System for Reliable Multicast
Keita Kashi, Shingo Ata, Ikuo Oka (Osaka City Univ.), Chikato Fujiwara (Osaka Seikei Univ.) |
Multicast is a useful transmission system when same data should be sent to multiple receivers. For reliable multicast, N... [more] |
IT2004-32
pp.5-10 |
| IT |
2004-09-16
14:20 |
Osaka |
Osaka Sangyo Univ. |
Calculation of a Threshold Value for a Character Recognition System
Oscar Vanegas (MEW) |
In general, an ideal character recognition system must be able to find characters on a selected region of interest even ... [more] |
IT2004-33
pp.11-14 |
| IT |
2004-09-16
14:55 |
Osaka |
Osaka Sangyo Univ. |
Steganography based on the variance like a measurement of complexity segmentation
Silvia Torres Maya, Brian Kurkoski, Kazuhiko Yamaguchi (Univ. of Electro-Comm.), Mariko Nakano Miyatake, RubenVazquez Medina (IPN) |
This paper presents a steganographical algorithm based on bit complexity segmentation(BPCS), which permits to implement ... [more] |
IT2004-34
pp.15-20 |
| IT |
2004-09-16
15:20 |
Osaka |
Osaka Sangyo Univ. |
Puctured convolutional codes with good performance
Yuki Ogami (Kinki Univ.), Noritugu Higaki (NTT SYSTEM), Hiroshi Sasano, Takuya Nishimura (Kinki Univ.) |
Punctured convolutional codes are obtained by periodically deleting bits from original codes to reduce code rate. It is ... [more] |
IT2004-35
pp.21-24 |
| IT |
2004-09-16
15:45 |
Osaka |
Osaka Sangyo Univ. |
Design Criteria for Space-Time Trellis Codes
Tetsuya Inoue, Taku Ogasawara, Koichiro Wakasugi (Kyoto Inst. of Tech.) |
In this report, a design criterion for STTC’s is proposed. In the conventional methods, the STTC encoder is designed by ... [more] |
IT2004-36
pp.25-30 |
| IT |
2004-09-16
16:20 |
Osaka |
Osaka Sangyo Univ. |
Quantum error correction using unitary operator for reflecting syndrome in correction
Kenichiro Furuta (Toshiba) |
It is shown in some papers that quantum error correction algorithm can be constructed only with unitary operators.
But ... [more] |
IT2004-37
pp.31-36 |
| IT |
2004-09-16
16:45 |
Osaka |
Osaka Sangyo Univ. |
Greedy Construction of LDPC Codes for Burst Erasure Channel
Tadashi Wadayama (OPU) |
[more] |
IT2004-44
pp.35-40 |
| IT |
2004-09-17
10:00 |
Osaka |
Osaka Sangyo Univ. |
Notes on Error-Correcting Capability of a Class of Subalphabet Subcodes of Reed-Solomon Codes
Yoshiyuki Ito, Kin-ichiroh Tokiwa (Osaka Sangyo Univ.) |
A subspace subcode of Reed-Solomon(SSRS) code is defined as a subset of a Reed-Solomon(RS) code over GF($2^m$) which con... [more] |
IT2004-38
pp.1-6 |
| IT |
2004-09-17
10:25 |
Osaka |
Osaka Sangyo Univ. |
Notes on a Class of Weakly Self-Dual Codes based on Generalized Reed-Solomon Codes
Kazutaka Kiyama, Kin-ichiroh Tokiwa (Osaka Sangyo Univ.) |
In this report, we investigate a class of generalized Reed-Solomon (GRS) codes which are weakly self-dual (w.s.d.) from ... [more] |
IT2004-39
pp.7-12 |
| IT |
2004-09-17
10:50 |
Osaka |
Osaka Sangyo Univ. |
An Approach to the Complete Weight Distribution of a Reed-Solomon Code
Toshihisa Nishijima (Hosei Univ.) |
In this paper, to find a clue to a solution of unsolved problems about the complete weight distribution of a Reed-Solomo... [more] |
IT2004-40
pp.13-18 |
| IT |
2004-09-17
11:15 |
Osaka |
Osaka Sangyo Univ. |
On Quasi-Cyclic LDPC Codes Based on Cyclic Difference Families
Masaya Fujisawa, Takashi Kimura (Tokyo Univ. of Science), Shojiro Sakata (Univ. of Electro-Comm.) |
We present a method for constructing regular low-density
parity-check (LDPC) codes based on cyclic difference families... [more] |
IT2004-41
pp.19-24 |
| IT |
2004-09-17
13:00 |
Osaka |
Osaka Sangyo Univ. |
A Code-Equivalent Transfomation Removing Cycles of Length Four in Tanner Graphs
Kenta Kasai (Tokyo Tech.), Tomoharu Shibuya (NIME), Kohichi Sakaniwa (Tokyo Tech.) |
[more] |
IT2004-42
pp.25-28 |
| IT |
2004-09-17
13:25 |
Osaka |
Osaka Sangyo Univ. |
A Study on the Reduction of Error Floor with CRC and OSD Algorithm for Irregular LDPC Codes
Satoshi Gounai, Tomoaki Ohtsuki (TUS) |
Irregular LDPC codes generally achieve the better performance than regular LDPC codes in the low Eb/N0 region. However, ... [more] |
IT2004-43
pp.29-34 |
| IT |
2004-09-17
13:50 |
Osaka |
Osaka Sangyo Univ. |
A Probabilistic Method for Computing the Weight Distribution of LDPC Codes
Masanori Hirotomo, Masami Mohri, Masakatu Morii (The Univ. of Tokushima) |
LDPC codes achieve outstanding performance by the sum-product decoder. The decoding error probabiltiy approaches the max... [more] |
IT2004-45
pp.41-46 |